Fixed-charge transportation on a path: linear programming formulations
From MaRDI portal
Recommendations
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Fixed-charge transportation problem: facets of the projection polyhedron
- Fixed-charge transportation problems on trees
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Valid inequalities and separation for uncapacitated fixed charge networks
Cites work
- A computational analysis of lower bounds for big bucket production planning problems
- Approximate extended formulations
- Capacitated facility location: Separation algorithms and computational experience
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Mixing sets linked by bidirected paths
- Network flows. Theory, algorithms, and applications.
- Network Formulations of Mixed-Integer Programs
- Projecting an extended formulation for mixed-integer covers on bipartite graphs
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(5)- Fixed-charge transportation problems on trees
- On how to allocate the fixed cost of transport systems
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Fixed-charge transportation problem: facets of the projection polyhedron
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
This page was built for publication: Fixed-charge transportation on a path: linear programming formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009780)
