COLE: a new heuristic approach for fixed charge problem computational results
From MaRDI portal
Publication:2573014
Recommendations
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- A heuristic algorithm for the fixed charge problem
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- A branch-and-bound algorithm for solving fixed charge problems
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Fast heuristic algorithms to solve a single-stage fixed-charge transportation problem
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A novel heuristic optimization method: charged system search
- New Computations Concerning the Cohen-Lenstra Heuristics
Cites work
- scientific article; zbMATH DE number 4147878 (Why is no real title available?)
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge 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 branch-and-bound algorithm for solving fixed charge problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- 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
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- An approximate solution method for the fixed charge problem
- An approximative algorithm for the fixed charge problem
- An approximative algorithm for the fixed-charges transportation problem
- An easy solution for a special class of fixed charge problems
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Fixed-cost transportation problems
- Ghost Image Processing for Minimum Covariance Determinants
- Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Optimization by ghost image processes in neural networks
- Set Partitioning: A survey
- 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
- Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
- Tabu search applied to the general fixed charge problem
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- The fixed charge problem
- The fixed charge problem
- The fixed charge problem. I: A new heuristic method
- The pure fixed charge transportation problem
- The telephonic switching centre network problem: Formalization and computational experience
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
Cited in
(10)- scientific article; zbMATH DE number 4147878 (Why is no real title available?)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Fractional polynomial bounds for the fixed charge problem
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
- An uncertain two-echelon fixed charge transportation problem
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- On lower bounds for the fixed charge problem
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
This page was built for publication: COLE: a new heuristic approach for fixed charge problem computational results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573014)
