Fixed-cost transportation problems
From MaRDI portal
Publication:3292913
Cited in
(54)- The pure fixed charge transportation problem
- 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
- A set covering reformulation of the pure fixed charge transportation problem
- On the fixed cost flow problem†
- IP over 40+ years at IBM scientific centers and marketing
- The transportation problem with packing constraints
- Quasi-concave minimization subject to linear constraints
- COLE: a new heuristic approach for fixed charge problem computational results
- Two classical transportation problems revisited: pure constant fixed charges and the paradox
- Degeneracy in fixed cost transportation problems
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
- 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é
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- An approach to solve a fuzzy bi-objective multi-index fixed charge transportation problem.
- Some transportation problems under uncertain environments
- Fractional polynomial bounds for the fixed charge problem
- Solving stochastic dynamic programming problems by linear programming — An annotated bibliography
- Grey transportation problem
- 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
- Eine Erweiterung des Transportproblems
- 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
- La programacion lineal bivalente mixta: Nuevo campo de aplicabilidad de las tecnicas de programacion lineal
- General network design: a unified view of combined location and network design problems
- Some computationally relevant group theoretic structures of fixed charge problems
- 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
- A vertex ranking algorithm for the fixed-charge transportation problem
- Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic
- Minimizing settlements
- Fixed charge transportation problem with type-2 fuzzy variables
- An approximative algorithm for the fixed charge problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- scientific article; zbMATH DE number 5629851 (Why is no real title available?)
- Uncertain random shortest path problem
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Facets and algorithms for capacitated lot sizing
- Scalable timing-aware network design via Lagrangian decomposition
- A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
- Logical processing for integer programming
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)
