A decomposition heuristic for mixed-integer supply chain problems

DOI10.1016/J.ORL.2020.02.006MaRDI QIDQ2183192OpenAlexFDO

Authors Lars Schewe, Martin Schmidt, Dieter Weninger

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

decompositionalternating direction methodpenalty methodsupply chainmixed-integer optimization

Mathematics Subject Classification ID

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

Recommendations

• Use of Lagrangian decomposition in supply chain planning
• Tackling industrial-scale supply chain problems by mixed-integer programming
• A variable neighborhood decomposition search method for supply chain management planning problems
• A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty
• Decomposition Branching for Mixed Integer Programming

Cites work

• scientific article; zbMATH DE number 3555723 (Why is no real title available?)
• A feasibility pump heuristic for general mixed-integer problems
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Decomposing Matrices into Blocks
• Learning when to use a decomposition
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• Production Planning by Mixed Integer Programming
• Progress in presolving for mixed integer programming
• Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
• Supply chain management and advanced planning -- basics, overview and challenges
• Tackling industrial-scale supply chain problems by mixed-integer programming
• The feasibility pump

Cited in

(7)

• Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system
• Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate
• Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• Enabling research through the SCIP Optimization Suite 8.0
• A variable neighborhood decomposition search method for supply chain management planning problems
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems

Describes a project that uses

Uses Software

• Gurobi

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183192)