COLE: a new heuristic approach for fixed charge problem computational results
From MaRDI portal
Publication:2573014
DOI10.1007/s10732-005-2135-xzbMath1122.90314OpenAlexW2136867876MaRDI QIDQ2573014
Publication date: 7 November 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-005-2135-x
Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, On lower bounds for the fixed charge problem, An extreme‐point tabu‐search algorithm for fixed‐charge network problems, Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, An uncertain two-echelon fixed charge transportation problem, Fractional polynomial bounds for the fixed charge problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
- The telephonic switching centre network problem: Formalization and computational experience
- The fixed charge problem. I: A new heuristic method
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Optimization by ghost image processes in neural networks
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- A tabu search heuristic procedure for the fixed charge transportation problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- 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
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Tabu search applied to the general fixed charge problem
- Fixed-cost transportation problems
- A branch-and-bound algorithm for solving fixed charge problems
- Some branch-and-bound procedures for fixed-cost transportation problems
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
- An approximative algorithm for the fixed-charges transportation problem
- An easy solution for a special class of fixed charge problems
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- The pure fixed charge transportation problem
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
- Set Partitioning: A survey
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Ghost Image Processing for Minimum Covariance Determinants
- An approximate solution method for the fixed charge problem
- The fixed charge problem
- An approximative algorithm for the fixed charge problem
- The fixed charge problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
