Filters








27,134 Hits in 5.1 sec

Forward-Backward Splitting for Optimal Transport based Problems [article]

Guillermo Ortiz-Jimenez, Mireille El Gheche, Effrosyni Simou, Hermina Petric Maretic, Pascal Frossard
2019 arXiv   pre-print
To overcome this limitation, we devise a general forward-backward splitting algorithm based on Bregman distances for solving a wide range of optimization problems involving a differentiable function with  ...  It is however challenging to design efficient optimization algorithms for optimal transport based extensions.  ...  CONCLUSIONS We have presented an efficient algorithm to solve regularized optimal transport problems based on forward-backward splitting and Bregman divergences.  ... 
arXiv:1909.11448v3 fatcat:m4c4ax5g6zanzdxyirhkc34xb4

A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem

Trung Hieu Tran, Maria Paola Scaparra, Jesse R. O'Hanley
2017 European Journal of Operational Research  
We develop a hypergraph search framework, including forward and backward procedures, to identify improving solutions efficiently.  ...  In this paper, we introduce a large-scale neighborhood search procedure for solving the single-source capacitated facility location problem (SSCFLP).  ...  Acknowledgments We thank four anonymous referees and the handling editor for very helpful comments made on earlier drafts of this paper.  ... 
doi:10.1016/j.ejor.2017.04.032 fatcat:q57oai3hyjdfnbknj5dlxyuisu

A Column Generation Algorithm for a Rich Vehicle-Routing Problem

Alberto Ceselli, Giovanni Righini, Matteo Salani
2009 Transportation Science  
We present an optimization algorithm developed for a provider of software planning tools for distribution logistics companies.  ...  The algorithm computes a daily plan for a heterogeneous fleet of vehicles, that can depart from different depots and must visit a set of customers for delivery operations.  ...  We developed a column generation algorithm, where the pricing problem is a particular resource constrained elementary shortest path problem, solved through a bounded bi-directional dynamic programming  ... 
doi:10.1287/trsc.1080.0256 fatcat:vdpar7ukt5fx5pqrpc4sp5cu2e

Adjoint Implementation of Rosenbrock Methods Applied to Variational Data Assimilation Problems

Dacian Daescu, Gregory R. Carmichael, Adrian Sandu
2000 Journal of Computational Physics  
Second, for the backward integration, a forward run stores the states within a splitting interval (1 + all chemistry steps).  ...  The technical report of the optimization process (and cost function value) and the CPU time of a forward run is about 3.7, which gives an average ratio cpu(pure backward integration +(3.2))/cpu(forward  ...  The time to read-write data to files is not considered for these ratios. Simplified recomputations for the advection-diffusion part are taken during the backward integration (see Fig. 5 ).  ... 
doi:10.1006/jcph.2000.6622 fatcat:rc2plaa33nadbo5gt3ygs4hhhy

State-of-the-art methods for inverse design of an enclosed environment

Wei Liu, Tengfei Zhang, Yu Xue, Zhiqiang (John) Zhai, Jihong Wang, Yun Wei, Qingyan Chen
2015 Building and Environment  
This paper discusses a number of backward and forward methods for inverse design.  ...  Forward methods, such as the CFD-based adjoint method, CFD-based genetic algorithm method, and proper orthogonal decomposition method, show the promise in the inverse design of airflow and heat transfer  ...  Forward methods This section discusses the forward methods based on the NS equations with CFD simulation techniques for inverse design.  ... 
doi:10.1016/j.buildenv.2015.02.041 pmid:32288031 pmcid:PMC7127361 fatcat:aqh4yoapfrdtpcuxzjzoqxmtnm

A decision-tree framework to select optimal box-sizes for product shipments [article]

Karthik S. Gurumoorthy, Abhiraj Hinge
2022 arXiv   pre-print
where each cluster corresponds to the group of products that will be shipped in a particular size variant, and (ii) present an efficient forward-backward decision tree based clustering method with low  ...  In this paper, we propose a solution for the single-count shipment containing one product per box in two steps: (i) reduce it to a clustering problem in the 3 dimensional space of length, width and height  ...  After reducing it to a clustering problem in 3 dimensions, we presented a decision-tree based algorithm containing forward and backward phases, coupled with steps like product reassignment, iterative refinement  ... 
arXiv:2202.04277v1 fatcat:lyo7mon72vcwnh7snkau2uhhli

Page 2796 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
A, 351-383 Summary: “We propose a way to reformulate a conic system of constraints as an optimization problem.  ...  We show computational results for solving both feasi- bility and optimization versions of the market split instances with up to 7 equations and 60 variables and discuss various branching strategies and  ... 

Development of a data assimilation algorithm

Per Grove Thomsen, Zahari Zlatev
2008 Computers and Mathematics with Applications  
Variational data assimilation techniques are based on a combination of three very important components • numerical methods for solving differential equations, • splitting procedures and • optimization  ...  Some results obtained in the search for a good combination of numerical methods, splitting techniques and optimization algorithms will be reported. Parallel techniques described in [V.N.  ...  The members of the staff of DCSC helped us to resolve some difficult problems related to the efficient exploitation of the grid of Sun computers.  ... 
doi:10.1016/j.camwa.2007.11.018 fatcat:7m4xmzys3ndxndju5zca4434ym

Research and Management Insights

2014 Production and operations management  
In addition, competition increases the attractiveness of backward integration relative to forward integration.  ...  Vertical Integration under Competition: Forward, Backward, or No Integration? Yen-Ting Lin, Ali K. Parlakt€ urk, Jayashankar M.  ... 
doi:10.1111/poms.12136 fatcat:cgueipop3jccvbylxdmk66rusi

Efficient Tree Solver for Hines Matrices on the GPU [article]

Felix Huber
2018 arXiv   pre-print
In this report we explain a new parallel GPU solver for these matrices which offers fine grained parallelization and allows for work balancing during the simulation setup.  ...  A key component in such simulations is an efficient solver for the Hines matrices used in computing inter-neuron signal propagation.  ...  The model used is based on the Hodgkin and Huxley model [6] , which describes the transport process of the action potential on the cell membrane.  ... 
arXiv:1810.12742v2 fatcat:w7nc3axxe5bilehvlplh3of25e

Synchronized Scheduling of Manufacturing and 3PL Transportation [chapter]

Kunpeng Li, Appa Iyer
2007 Multiprocessor Scheduling, Theory and Applications  
This type of operation is particularly true for 3PLs that providing road transportation services.  ...  Chen and Vairaktarakis (2005) addressed the integrated production transportation scheduling problem considering the first type of 3PL  ...  Backward Synchronized Scheduling Heuristic (BSSH) Steps of BSSH are the same as FSSH except for step 4. Backward scheduling is used in step 4 in BSSH instead of forward scheduling in FSSH.  ... 
doi:10.5772/5233 fatcat:akj46grcinah7kzdanctamheyy

Melt-mixing by novel pitched-tip kneading disks in a co-rotating twin-screw extruder

Yasuya Nakayama, Eiji Takeda, Takashi Shigeishi, Hideki Tomiyama, Toshihisa Kajiwara
2011 Chemical Engineering Science  
We investigated four typical arrangements of the ptKDs, which are forward and backward disk-staggers combined with forward and backward tips.  ...  Quantifying the mixing performance of kneading elements based on their internal physical processes is a challenging problem.  ...  Acknowledgments The computation was mainly carried out using the computer facilities at Research Institute for Information Technology in Kyushu University, and Supercomputing Division of Information Technology  ... 
doi:10.1016/j.ces.2010.10.022 fatcat:kzuhj44vv5h6xjwcmpnpuf6ugi

An Optimal Control Approach for Texture Metamorphosis

Ilknur Kabul, Stephen M. Pizer, Julian Rosenman, Marc Niethammer
2011 Computer graphics forum (Print)  
We use a new energy optimization scheme derived from optimal control principles which exploits the structure of the metamorphosis optimality conditions.  ...  In this paper, we introduce a new texture metamorphosis approach for interpolating texture samples from a source texture into a target texture.  ...  Acknowledgements This material is based upon work supported by the National Science Foundation (NSF) under Grant No.  ... 
doi:10.1111/j.1467-8659.2011.02067.x fatcat:uqrq4qlpa5hzthm4dqs6jpan7q

Optimal Hyperpaths With Non-Additive Link Costs

Saeed Maadi, Jan-Dirk Schmöcker
2017 Transportation Research Procedia  
In the first stage we test whether the optimal hyperpath can be obtained by backward search.  ...  In the first stage we test whether the optimal hyperpath can be obtained by backward search.  ...  Hyperpaths for passive critical nodes are assigned based on optimal hyperpaths from Stage 1.  ... 
doi:10.1016/j.trpro.2017.05.044 fatcat:575ht5jrbvh6zjdyepngbvhvta

Machine Learning for Predictive Modelling of Ambulance Calls

Miao Yu, Dimitrios Kollias, James Wingate, Niro Siriwardena, Stefanos Kollias
2021 Electronics  
The forward model is implemented through a machine, or deep learning technique, whilst the backward model is implemented through unsupervised learning.  ...  ) should be given to the ambulance call, or not; in the second, a backward model analyzes the latent variables extracted from the forward model to infer the decision making procedure.  ...  wish to express our gratitude to the United Kingdom East Midlands Ambulance Service NHS Trust, who have provided the data set with the explanatory and response variables referring to ambulance calls for  ... 
doi:10.3390/electronics10040482 fatcat:kif7ujek2jflrb7p6yufxeccuu
« Previous Showing results 1 — 15 out of 27,134 results