Polyhedral combinatorics of multi-index axial transportation problems

DOI10.1016/j.ejor.2007.02.059zbMath1190.90164MaRDI QIDQ2482774

M. K. Kravtsov, E. V. Lukshin

Publication date: 24 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.059

zbMATH Keywords

integer points; integer vertices; noninteger vertices

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Cites Work

• A linear bound on the diameter of the transportation polytope
• Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower
• Approximation algorithms for multi-index transportation problems with decomposable costs
• Types of \((3n-2)\)-noninteger vertices of the polytope of three-index axial problem of choice
• An LP-based algorithm for the data association problem in multitarget tracking.
• Elements of statistical disclosure control
• The square of the minor of the constraint matrix of the axial transport problem: its mean
• Complexity of a 3-dimensional assignment problem
• On representatives of multi-index transportation problems
• On the noninteger polyhedron vertices of the three-index axial transportation problem
• Transportation polytopes
• Polytopes de transport symétriques
• An algorithm for the optimum time-cost trade-off in three dimensional transportation problem
• New Methods in Mathematical Programming—The Solid Transportation Problem
• Polyhedral aspects of multi-index axial transportation problems
• Multi-index planar transportation polytopes with maximum number of vertices
• On the Complexity of Timetable and Multicommodity Flow Problems
• Three-dimensional Statistical Data Security Problems
• Asymptotic behaviour of multi-index axial transportation polyhedra
• On some properties of three-index transportation polytopes
• A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
• On non-integer vertices of the polytope of the three-index axial assignment problem
• The Capacitated Carrier Transportation Problem: An Application of the Axial Three-Dimensional Transportation Problem with Heuristic
• Integer Programming and Combinatorial Optimization
• The Multi-Index Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item