A decomposition heuristic for mixed-integer supply chain problems

DOI10.1016/j.orl.2020.02.006OpenAlexW3009834077MaRDI QIDQ2183192

Lars Schewe, Dieter Weninger, Martin Schmidt

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://www.research.ed.ac.uk/portal/en/publications/a-decomposition-heuristic-for-mixedinteger-supply-chain-problems(671ff374-3da1-42fc-800d-f3a7707276dd).html

zbMATH Keywords

decompositionsupply chainpenalty methodalternating direction methodmixed-integer optimization

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items (3)

An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Supply chain management and advanced planning -- basics, overview and challenges
• Progress in presolving for mixed integer programming
• Learning when to use a decomposition
• A feasibility pump heuristic for general mixed-integer problems
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• The feasibility pump
• Decomposing Matrices into Blocks
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming
• Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
• Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
• Production Planning by Mixed Integer Programming

This page was built for publication: A decomposition heuristic for mixed-integer supply chain problems