Complexity and approximation algorithms for fixed charge transportation problems
From MaRDI portal
Cites work
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- 0-1 reformulations of the multicommodity capacitated network design problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A set covering reformulation of the pure fixed charge transportation problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- Approximating the k-set packing problem by local improvements
- Approximation Algorithms for Directed Steiner Problems
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Fixed-charge transportation problem: facets of the projection polyhedron
- Improved approximation for 3-dimensional matching via bounded pathwidth local search
- k-Partition-based facets of the network design problem
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- On cut-based inequalities for capacitated network design polyhedra
- Polylogarithmic inapproximability
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- Some branch-and-bound procedures for fixed-cost transportation problems
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- The fixed charge problem
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- The pure fixed charge transportation problem
- Two classical transportation problems revisited: pure constant fixed charges and the paradox
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
This page was built for publication: Complexity and approximation algorithms for fixed charge transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290055)
