Some computationally relevant group theoretic structures of fixed charge problems

DOI10.1007/BF01580683zbMath0345.90046OpenAlexW2009205678MaRDI QIDQ4114962

Ronald L. Rardin, V. E. Unger

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580683

Mathematics Subject Classification ID

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

Cites Work

• Some polyhedra related to combinatorial problems
• Fixed-cost transportation problems
• Solving fixed charge network problems with group theory-based penalties
• The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• FACES OF AN INTEGER POLYHEDRON
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II