Using duality to solve discrete optimization problems: Theory and computational experience

Publisher Website

1 January 1975

book chapter
Published by Springer Nature

p. 56-94
https://doi.org/10.1007/bfb0120699

Abstract

No abstract available

Keywords

This publication has 29 references indexed in Scilit:

A dual algorithm for the one-machine scheduling problem
Mathematical Programming, 1976
Improved integer programming bounds using intersections of corner polyhedra
Mathematical Programming, 1975
Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
Operations Research, 1973
Matroids and the greedy algorithm
Mathematical Programming, 1971
Lagrange Multipliers and Nonconvex Programs
SIAM Journal on Control, 1969
An Algorithm for Separable Nonconvex Programming Problems
Management Science, 1969
DECOMPOSITION PROGRAMMING AND ECONOMIC PLANNING
Published by Defense Technical Information Center (DTIC) ,1967
Optimal Programming of Lot Sizes, Inventory and Labor Allocations
Management Science, 1965
Letter to the Editor—On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer Programming
Operations Research, 1965
The Relaxation Method for Linear Inequalities
Canadian Journal of Mathematics, 1954

Cited by 63 articles