Some aspects of integer programming duality

DOI10.1016/0377-2217(81)90282-4zbMath0452.90050OpenAlexW2024341020MaRDI QIDQ1148793

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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Aggregation of equations in integer programming
• Integer Programming and Pricing
• Concepts of optimality and their uses
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions

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