Search Results - Mixed integer programming Dantzig-Wolfe decomposition Reformulation

Automatic Dantzig-Wolfe reformulation of mixed integer programs.

Authors: Bergner, Martin Caprara, Alberto Ceselli, Alberto et al.

Source: Mathematical Programming. Feb2015, Vol. 149 Issue 1/2, p391-424. 34p.

Subject Terms: *MATHEMATICAL reformulation, *MIXED integer linear programming, *AUTOMATIC control systems, *MATHEMATICAL decomposition, *MATHEMATICAL bounds

A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

Authors: Degraeve, Z. Jans, R.F.

Source: Operations Research. 55:909-920

Subject Terms: jel:M, jel:M11, 0209 industrial biotechnology, jel:C61, 0211 other engineering and technologies, 02 engineering and technology, jel:R4, Dantzig-Wolfe decomposition, Lagrange relaxation, branch-and-price, lot sizing, mixed-integer programming

Access URL: https://repub.eur.nl/pub/275/ERS-2003-010-LIS.pdf
https://pure.eur.nl/en/publications/cc3adb7d-c34c-4017-8710-955ffd44ddc8
https://doi.org/10.1287/opre.1070.0404
https://ideas.repec.org/a/inm/oropre/v55y2007i5p909-920.html
https://repub.eur.nl/pub/275/ERS-2003-010-LIS.pdf
https://repub.eur.nl/pub/275
https://pubsonline.informs.org/doi/abs/10.1287/opre.1070.0404
https://www.jstor.org/stable/25147131
https://core.ac.uk/display/43320675

Scheduling UAV-assisted urban subway inspection services.

Authors: Zhou, Bolong Zeng, Wenjia Liu, Wei et al.

Source: Transportation Research Part B: Methodological. Sep2025, Vol. 199, pN.PAG-N.PAG. 1p.

Subject Terms: *MATHEMATICAL optimization, *MIXED integer linear programming, *SCHEDULING, *ECONOMIC efficiency, *COST control, *ENGINEERING inspection, *DRONE aircraft, *DECOMPOSITION method

Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition.

Authors: Gleixner, Ambros Maher, Stephen J. Müller, Benjamin et al.

Source: Annals of Operations Research. Jan2020, Vol. 284 Issue 2, p527-555. 29p.

Subject Terms: *NONLINEAR programming, *CIRCLE, *ALGORITHMS, *RECTANGLES, *DESIGN techniques

Recovering Dantzig–Wolfe Bounds by Cutting Planes.

Authors: Chen, Rui Günlük, Oktay Lodi, Andrea

Source: Operations Research; Mar/Apr2025, Vol. 73 Issue 2, p1128-1142, 15p

Subject Terms: MIXED integer linear programming, ASSIGNMENT problems (Programming), KNAPSACK problems, INTEGER programming, PRICES

Decomposition Branching for Mixed Integer Programming.

Authors: Yıldız, Barış Boland, Natashia Savelsbergh, Martin

Source: Operations Research; May/Jun2022, Vol. 70 Issue 3, p1854-1872, 19p

Subject Terms: INTEGER programming, ASSIGNMENT problems (Programming), COMBINATORIAL optimization, INTEGERS, RESEARCH implementation

Scalable branching on dual decomposition of stochastic mixed-integer programming problems.

Authors: Kim, Kibaek Dandurand, Brian

Source: Mathematical Programming Computation; Mar2022, Vol. 14 Issue 1, p1-41, 41p

A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties.

Authors: Huang, Zhouchun Zheng, Qipeng P. Liu, Andrew L.

Source: INFORMS Journal on Computing; Jul/Aug2022, Vol. 34 Issue 4, p1919-1939, 21p

Subject Terms: ELECTRIC power systems, ALGORITHMS, PARALLEL programming, INTEGER programming, RENEWABLE energy sources

Structure Detection in Mixed-Integer Programs.

Authors: Khaniyev, Taghi Elhedhli, Samir Erenay, Fatih Safa

Source: INFORMS Journal on Computing. Summer2018, Vol. 30 Issue 3, p570-587. 18p.

Subject Terms: *MIXED integer linear programming, *PARALLEL processing, *QR factorization, *LU factorization, *LAGRANGIAN functions

Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming.

Authors: Daryalal, Maryam Bodur, Merve Luedtke, James R.

Source: Operations Research; Mar/Apr2024, Vol. 72 Issue 2, p717-737, 21p

Subject Terms: STOCHASTIC programming, DISTRIBUTION (Probability theory), HISTORY of cartography, APPLIED mathematics, SCIENTIFIC computing

Company/Entity: NATIONAL Science Foundation (U.S.)

The p-Lagrangian relaxation for separable nonconvex MIQCQP problems.

Authors: Andrade, Tiago Belyak, Nikita Eberhard, Andrew et al.

Source: Journal of Global Optimization; Sep2022, Vol. 84 Issue 1, p43-76, 34p

Subject Terms: INTEGER programming, STOCHASTIC programming, DECOMPOSITION method, QUADRATIC programming, AUTHORSHIP

Long-term operational planning of energy storage and supply systems based on time-domain decomposition

Authors: Boyun Zhang Ryohei YOKOYAMA Tetsuya WAKUI

Source: The Proceedings of the International Conference on Power Engineering (ICOPE). 2021, :2021-0191

Primal Heuristics for Branch and Price: The Assets of Diving Methods.

Authors: Sadykov, Ruslan Vanderbeck, François Pessoa, Artur et al.

Source: INFORMS Journal on Computing; Spring2019, Vol. 31 Issue 2, p251-267, 17p

Subject Terms: MATHEMATICAL reformulation, HEURISTIC, ASSIGNMENT problems (Programming), LINEAR programming, INTEGER programming, ASSETS (Accounting), PRICES

Long-term Operational Planning of Energy Storage and Supply Systems Based on Time-Domain Decomposition / 時間領域分解に基づくエネルギー貯蔵・供給システムの長期間運用計画

Authors: Ryohei YOKOYAMA Tetsuya WAKUI Zhang BOYUN et al.

Source: The Proceedings of the National Symposium on Power and Energy Systems. 2021, :232

A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times

Authors: Degraeve, Z. (Zeger) Jans, R.F. (Raf)

Index Terms: Algorithms: decomposition, Branch-and-price, Column generation, Integer programming, Inventory/production: lot sizing: setup times, info:eu-repo/semantics/article

URL: http://repub.eur.nl/pub/75191

Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing.

Authors: Xia, Yang Zeng, Wenjia Xing, Xinjie et al.

Source: Annals of Operations Research; Aug2023, Vol. 327 Issue 1, p89-127, 39p

Subject Terms: SUPPLY chains, DATA encryption, SHARING economy, BLOCKCHAINS, DISTRIBUTION planning, ECONOMIC indicators, SHARING

Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem.

Authors: Pimentel, CarinaMaria Oliveira Alvelos, FilipePereira e Valério de Carvalho, JoséManuel

Source: Optimization Methods & Software; Apr2010, Vol. 25 Issue 2, p299-319, 21p, 4 Charts

Subject Terms: LINEAR programming, INTEGER programming, DYNAMIC programming, MATHEMATICAL programming, OPERATIONS research

Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem.

Authors: Basciftci, Beste Ahmed, Shabbir Gebraeel, Nagi

Source: Manufacturing & Service Operations Management (M&SOM); Nov/Dec2024, Vol. 26 Issue 6, p2121-2141, 21p

Subject Terms: STOCHASTIC programming, STOCHASTIC analysis, RENEWABLE energy sources, APPROXIMATION algorithms, HEURISTIC algorithms

Simultaneously exploiting two formulations: An exact benders decomposition approach

Authors: Lusby, Richard Martin Gamst, Mette Røpke, Stefan et al.

Source: Lusby , R M , Gamst , M , Røpke , S & Spoorendonk , S 2020 , ' Simultaneously exploiting two formulations: An exact benders decomposition approach ' , Computers and Operations Research , vol. 123 , 105041 .

Index Terms: Mixed Integer Programming, Benders Decomposition, Cutting Stock Problem, Split Delivery Vehicle Routing, article

URL: https://orbit.dtu.dk/en/publications/5e1e08ec-0ae1-427a-a11e-fe7e1b12e6d2
https://doi.org/10.1016/j.cor.2020.105041
https://backend.orbit.dtu.dk/ws/files/241121873/Simultaneously_exploiting_two_formulations_An_exact_benders_decomposition_approach.pdf

Consistency Cuts for Dantzig-Wolfe Reformulations

Authors: Clausen, Jens Vinther Lusby, Richard Ropke, Stefan

Source: Clausen , J V , Lusby , R & Ropke , S 2022 , ' Consistency Cuts for Dantzig-Wolfe Reformulations ' , Operations Research , vol. 70 , no. 5 , pp. 2883–2905 .

Index Terms: Integer programming, Cutting plane/facet, Algorithms, Theory, article

URL: https://orbit.dtu.dk/en/publications/d7943a03-dd5b-4a0c-b02e-ccf88b1eb186
https://doi.org/10.1287/opre.2021.2160
https://backend.orbit.dtu.dk/ws/files/302264256/opre.2021.2160.pdf