Results 61 to 70 of about 609,732 (141)

Reformulation and decomposition of integer programs [PDF]

In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based ...
WOLSEY , Laurence, VANDERBECK  , François   +1 more
core  

Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems [PDF]

, 2009
Operations Research, 57, pp. 1271-1286.We describe a multistage, stochastic, mixed-integer programming model for planning capacity expansion of production facilities.
Wood, Kevin, Singh, Kavinesh J., Philpott, Andy B.   +2 more
core   +3 more sources

A Tolerance-Aware Pricing Certificate for Stabilized Dantzig–Wolfe Branch-and-Price in Unit Commitment

Algorithms
Stabilized proposal pricing may reduce exact subproblem work, but it cannot by itself certify branch-and-price node termination. A conditional, tolerance-adjusted node-pricing bound is developed for deterministic unit commitment.
Zihan Zhang, Jiani Li, Haoyu Yang, Zengji Zheng, Yijian Lu   +4 more
doaj   +1 more source

Lagrange relaxation and Dantzig-Wolfe decomposition

, 1989
The paper concerns a large-scale linear programming problem having a block-diagonal structure with coupling constraints. It is shown that there are deep connections between the Lagrange relaxation techniques and the Dantzig-Wolfe decomposition ...
Vidal, Rene Victor Valqui
core  

Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming [PDF]

, 2002
This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends ...
Lyu, Jung, Lee, Ming-Chang, Luh, Hsing
core   +1 more source

Polyhedral aspects of Dantzig-Wolfe reformulation

, 2019
Although Dantzig-Wolfe reformulation for integer programs has practically proven to yield strong relaxations in various applications, there is only a poor theoretical understanding of Dantzig-Wolfe reformulation in general.
Witt, Jonas Timon
core   +1 more source

Routing optimization for UAV-rider joint delivery in multi-center networks

Shenzhen Daxue xuebao. Ligong ban
To reduce operating costs and improve fulfillment efficiency in urban on-demand logistics, this study investigates the routing optimization problem for unmanned aerial vehicle (UAV)-rider joint delivery in multi-center networks with limited UAV capacity.
Bai Yaozhen, Li Xueyou, Qi Mingyao
doaj   +1 more source

Distributed MPC under coupled constraints based on Dantzig-Wolfe decomposition

, 2013
ISBN : 978-94-007-7006-5In this chapter, we propose a distributed model predictive control scheme based on the Dantzig-Wolfe decomposition to control a collection of linear dynamical systems coupled by linear global constraints.
Morosan, Daniel-Petru, Dumur, Didier, Buisson, Jean, Bourdais, Romain, Guéguen, Hervé   +4 more
core   +1 more source

A Θ(m⁹) Ternary Minimum-Cost Network Flow LP Model of the Assignment Problem Polytope, with Applications to Hard Combinatorial Optimization Problems

Logistics
Background: Combinatorial optimization problems (COPs) are central to Logistics and Supply Chain decision making, yet their NP-hardness prevents exact optimal solutions in reasonable time.
Moustapha Diaby
doaj   +1 more source

Solving an airport ground service task assignment problem with an exact algorithm. [PDF]

PLoS One, 2022
Tian Q, Li J, Huang G, Yuan W.
europepmc   +1 more source