Fixed-cost transportation problems
From MaRDI portal
Publication:3292913
DOI10.1002/NAV.3800080104zbMATH Open0106.34801OpenAlexW1967088945MaRDI QIDQ3292913FDOQ3292913
Authors: Michel Balinski 
Publication date: 1961
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800080104
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (54)
- An approach to solve a fuzzy bi-objective multi-index fixed charge transportation problem.
- La programacion lineal bivalente mixta: Nuevo campo de aplicabilidad de las tecnicas de programacion lineal
- Minimizing settlements
- Scalable timing-aware network design via Lagrangian decomposition
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- On how to allocate the fixed cost of transport systems
- On the fixed cost flow problem†
- A set covering reformulation of the pure fixed charge transportation problem
- The transportation problem with packing constraints
- IP over 40+ years at IBM scientific centers and marketing
- Quasi-concave minimization subject to linear constraints
- COLE: a new heuristic approach for fixed charge problem computational results
- Degeneracy in fixed cost transportation problems
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
- Two classical transportation problems revisited: pure constant fixed charges and the paradox
- An extension of the product-parts replacement problem
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Title not available (Why is that?)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Solving stochastic dynamic programming problems by linear programming — An annotated bibliography
- Grey transportation problem
- Fractional polynomial bounds for the fixed charge problem
- Eine Erweiterung des Transportproblems
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- A study of the fixed charge transportation problem
- New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation
- A tabu search heuristic procedure for the fixed charge transportation problem
- Credit linked two-stage multi-objective transportation problem in rough and bi-rough environments
- General network design: a unified view of combined location and network design problems
- Some computationally relevant group theoretic structures of fixed charge problems
- Some Transportation Problems Under Uncertain Environments
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
- Exact algorithm for solving a special fixed-charge linear programming problem
- A matheuristic for the two-stage fixed-charge transportation problem
- On lower bounds for the fixed charge problem
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- A heuristic algorithm for the fixed charge problem
- Approximating some network design problems with node costs
- Heuristic algorithms for the fixed-charge transportation problem
- Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic
- A vertex ranking algorithm for the fixed-charge transportation problem
- An approximative algorithm for the fixed charge problem
- Fixed charge transportation problem with type-2 fuzzy variables
- Title not available (Why is that?)
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Uncertain random shortest path problem
- Facets and algorithms for capacitated lot sizing
- A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
- Logical processing for integer programming
- The pure fixed charge transportation problem
This page was built for publication: Fixed-cost transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3292913)
