Some computationally relevant group theoretic structures of fixed charge problems

DOI10.1007/BF01580683MaRDI QIDQ4114962zbMATH OpenOpenAlexFDO

Authors 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

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

This page was built for publication: Some computationally relevant group theoretic structures of fixed charge problems

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