Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem

DOI10.1287/OPRE.23.6.1183MaRDI QIDQ4096140zbMATH OpenOpenAlexFDO

Authors Patrick G. McKeown

Publication date 1975

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.23.6.1183

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(9)

• A vertex ranking algorithm for the fixed-charge transportation problem
• 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 computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• COLE: a new heuristic approach for fixed charge problem computational results
• An algorithm for solving fixed-charge problems using surrogate constraints
• The pure fixed charge transportation problem
• An approach to solve a fuzzy bi-objective multi-index fixed charge transportation problem.

This page was built for publication: Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096140)