Duality and admissible transformations in combinatorial optimization

DOI10.1007/BF01954690zbMATH Open0413.90051OpenAlexW1990542124MaRDI QIDQ3048583FDOQ3048583

Authors: Ulrich Derigs 

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

zbMATH Keywords

combinatorial optimizationinteger programmingassignment problemsdualityshortest pathdirected graphsvector optimizationbottleneck problemmulticriteria problemalgebraic systemstransportation problemsadmissible transformationsprogramming in abstract spacesalgebraic linear programmingalgebraic objective functionsperfect matching problemstime cost problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Paths and cycles (05C38) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming in abstract spaces (90C48)

Cites Work

• A note on two problems in connexion with graphs
• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Maximum matching and a polyhedron with 0,1-vertices
• On abstract dual linear programs
• Node-and edge-deletion NP-complete problems
• Bottleneck Linear Programming
• An augmenting path method for solving linear bottleneck assignment problems
• An algebraic approach to assignment problems
• Weakly admissible transformations for solving algebraic assignment and transportation problems
• An augmenting path method for solving linear bottleneck transportation problems
• A general Hungarian method for the algebraic transportation problem
• A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
• Title not available (Why is that?)
• Bottleneck linear programming
• Title not available (Why is that?)

Cited In (2)

• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
• Quadratic assignment problems

This page was built for publication: Duality and admissible transformations in combinatorial optimization

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