Duality and admissible transformations in combinatorial optimization

DOI10.1007/BF01954690MaRDI QIDQ3048583zbMATH OpenOpenAlexFDO

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

dualityvector optimizationtransportation problemstime cost problemshortest pathprogramming in abstract spacesperfect matching problemsmulticriteria probleminteger programmingadmissible transformationsdirected graphscombinatorial optimizationbottleneck problemassignment problemsalgebraic systemsalgebraic objective functionsalgebraic linear programming

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

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

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)