COLE: a new heuristic approach for fixed charge problem computational results

DOI10.1007/S10732-005-2135-XzbMATH Open1122.90314OpenAlexW2136867876MaRDI QIDQ2573014FDOQ2573014

Authors: Fred Glover 

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

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

zbMATH Keywords

networkstabu searchgeneralized networksfixed-charge problemsghost image processes

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Network design and communication in computer systems (68M10)

Cites Work

• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Title not available (Why is that?)
• A tabu search heuristic procedure for the fixed charge transportation problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• The fixed charge problem
• Set Partitioning: A survey
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Some branch-and-bound procedures for fixed-cost transportation problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• The fixed charge problem. I: A new heuristic method
• Fixed-cost transportation problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
• Tabu search applied to the general fixed charge problem
• The telephonic switching centre network problem: Formalization and computational experience
• A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• A branch-and-bound algorithm for solving fixed charge problems
• An approximative algorithm for the fixed charge problem
• Optimization by ghost image processes in neural networks
• An approximative algorithm for the fixed-charges transportation problem
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• The pure fixed charge transportation problem
• Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
• Title not available (Why is that?)
• Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
• 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
• Title not available (Why is that?)
• An easy solution for a special class of fixed charge problems
• Ghost Image Processing for Minimum Covariance Determinants

Cited In (10)

• 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
• An extreme‐point tabu‐search algorithm for fixed‐charge network problems
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• An uncertain two-echelon fixed charge transportation problem
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
• Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
• On lower bounds for the fixed charge problem
• Title not available (Why is that?)

Uses Software

• CPLEX
• Tabu search

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)