Pages that link to "Item:Q5946817"
From MaRDI portal
The following pages link to Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817):
Displayed 23 items.
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
- A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- Memetic algorithms (Q2573010) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location (Q3532778) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)