Duality and admissible transformations in combinatorial optimization
DOI10.1007/BF01954690zbMath0413.90051OpenAlexW1990542124MaRDI QIDQ3048583
Publication date: 1979
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01954690
vector optimizationinteger programmingshortest pathcombinatorial optimizationassignment problemsdualitytransportation problemsdirected graphsbottleneck problemalgebraic systemsmulticriteria problemadmissible transformationsprogramming in abstract spacesalgebraic linear programmingalgebraic objective functionsperfect matching problemstime cost problem
Extremal problems in graph theory (05C35) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Paths and cycles (05C38) Programming in abstract spaces (90C48) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- An augmenting path method for solving linear bottleneck assignment problems
- A general Hungarian method for the algebraic transportation problem
- An augmenting path method for solving linear bottleneck transportation problems
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- Bottleneck Linear Programming
- Bottleneck linear programming
- An algebraic approach to assignment problems
- Paths, Trees, and Flowers
- Node-and edge-deletion NP-complete problems
- Maximum matching and a polyhedron with 0,1-vertices
- On abstract dual linear programs
