scientific article; zbMATH DE number 1063799
From MaRDI portal
Publication:4355486
DOI10.1002/(SICI)1097-0037(199708)30:1%3C57::AID-NET7%3E3.0.CO;2-KzbMATH Open0878.90036MaRDI QIDQ4355486FDOQ4355486
Publication date: 21 September 1997
Title of this publication is not available (Why is that?)
Cited In (4)
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Uncapacitated flow-based extended formulations
- The family constrained network problem
Recommendations
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems 👍 👎
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem 👍 👎
- Solving to optimality the uncapacitated fixed-charge network flow problem 👍 👎
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem 👍 👎
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem 👍 👎
- On the uncapacitatedK-commodity network design problem with zero flow-costs 👍 👎
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design 👍 👎
- Title not available (Why is that?) 👍 👎
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach 👍 👎
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355486)
