DOI10.1007/BFb0121090zbMath0596.90098MaRDI QIDQ3730370
Paul Mireault, Richard T. Wong, Thomas L. Magnanti
Publication date: 1986
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Exact approaches to the single-source network loading problem,
Multiple allocation hub-and-spoke network design under hub congestion,
A capacity scaling heuristic for the multicommodity capacitated network design problem,
Decomposition based hybrid metaheuristics,
Solving a capacitated hub location problem,
An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems,
The generalized fixed-charge network design problem,
Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain,
A decomposition method for the min concave cost flow problem with a staircase structure,
Benders decomposition approach for the robust network design problem with flow bifurcations,
Benders decomposition for network design covering problems,
LP extreme points and cuts for the fixed-charge network design problem,
Tree network design avoiding congestion,
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure,
Benders decomposition for the uncapacitated multiple allocation hub location problem,
Benders decomposition for set covering problems. Almost satisfying the consecutive ones property,
Solving the optimum communication spanning tree problem,
Analysis of a flow problem with fixed charges,
Solving minimum-cost shared arborescence problems,
The Benders decomposition algorithm: a literature review,
Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem,
A survey on Benders decomposition applied to fixed-charge network design problems,
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design,
A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations,
Exact solution algorithms for the maximum flow problem with additional conflict constraints,
A Benders decomposition approach for the robust spanning tree problem with interval data,
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure,
Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints,
Optimization of Internet Protocol network design and routing,
Solving to optimality the uncapacitated fixed-charge network flow problem,
A robustness approach to uncapacitated network design problems,
A tailored Benders decomposition approach for last-mile delivery with autonomous robots,
Mixed-integer programming approaches for the tree \(t^*\)-spanner problem,
Benders-and-cut algorithm for fixed-charge capacitated network design problem,
Memetic algorithms,
Exact solution of multicommodity network optimization problems with general step cost functions,
A technique for speeding up the solution of the Lagrangean dual,
Scatter search for network design problem,
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints