Some aspects of integer programming duality

DOI10.1016/0377-2217(81)90282-4MaRDI QIDQ1148793zbMATH OpenOpenAlexFDO

Authors Stanisław Walukiewicz

Publication date 1981

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

Full work available at URL https://doi.org/10.1016/0377-2217(81)90282-4

zbMATH Keywords

branch-and-bound algorithmdualityinteger Lagrangean relaxationoptimal dual variables

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3670180 (Why is no real title available?)
• scientific article; zbMATH DE number 3675620 (Why is no real title available?)
• scientific article; zbMATH DE number 3511864 (Why is no real title available?)
• scientific article; zbMATH DE number 3550467 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Aggregation of equations in integer programming
• Concepts of optimality and their uses
• Integer Programming and Pricing
• Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(2)

• A shadow price in integer programming for management decision
• An interval efficiency analysis with dual-role factors

This page was built for publication: Some aspects of integer programming duality

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