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

DOI10.1287/opre.23.6.1183zbMath0329.90041OpenAlexW2130812847MaRDI QIDQ4096140

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)

Related Items (8)

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ An algorithm for solving fixed-charge problems using surrogate constraints ⋮ A vertex ranking algorithm for the fixed-charge transportation problem ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ A tabu search heuristic procedure for the fixed charge transportation problem ⋮ The pure fixed charge transportation problem

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