Some computationally relevant group theoretic structures of fixed charge problems
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 10 (1) , 379-400
- https://doi.org/10.1007/bf01580683
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Solving fixed charge network problems with group theory‐based penaltiesNaval Research Logistics Quarterly, 1976
- Cyclic Groups, Cutting Planes, Shortest PathsPublished by Elsevier ,1973
- Some continuous functions related to corner polyhedra, IIMathematical Programming, 1972
- Some continuous functions related to corner polyhedraMathematical Programming, 1972
- Technical Note—Exact Solution of the Fixed-Charge Transportation ProblemOperations Research, 1971
- Technical Note—An Improved Branch-and-Bound Method for Integer ProgrammingOperations Research, 1971
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- FACES OF AN INTEGER POLYHEDRONProceedings of the National Academy of Sciences, 1967
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMSProceedings of the National Academy of Sciences, 1965
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961