A New Optimization Method for Large Scale Fixed Charge Transportation Problems
From MaRDI portal
Cited in
(34)- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Solving to optimality the uncapacitated fixed-charge network flow problem
- The teacher assignment problem: A special case of the fixed charge transportation problem
- An algorithm for a concave production cost network flow problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A tabu search heuristic procedure for the fixed charge transportation problem
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- A novel intensive distribution logistics network design and profit allocation problem considering sharing economy
- Formulating and solving production planning problems
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals
- COLE: a new heuristic approach for fixed charge problem computational results
- An algorithm for solving fixed-charge problems using surrogate constraints
- Minimizing a sum of staircase functions under linear constraints
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
- An integer programming column generation principle for heuristic search methods
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Investigation of a multi-objective fixed charge transportation problem with quantity dependent transportation cost and discount policy via metaheuristics
- Complexity and approximation algorithms for fixed charge transportation problems
- Complexity and approximation algorithms for fixed charge transportation problems
- Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
This page was built for publication: A New Optimization Method for Large Scale Fixed Charge Transportation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3904373)
