Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Review

2010

Review

2010

This textbook provides a comprehensive modeling, reformulation and optimization approach for solving production planning and…

Review

2004

Review

2004

(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1-18, published by The Institute…

Highly Cited

1999

Highly Cited

1999

Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND…

Highly Cited

1988

Highly Cited

1988

FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory…

Highly Cited

1986

Highly Cited

1986

Abstract Integer programming has benefited from many innovations in models and methods. Some of the promising directions for…

Highly Cited

1983

Highly Cited

1983

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof…

Highly Cited

1977

Highly Cited

1977

This paper proposes a class of surrogate constraint heuristics for obtaining approximate, near optimal solutions to integer…

Highly Cited

1975

Highly Cited

1975

A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer…

Highly Cited

1972

Highly Cited

1972

The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning…

Highly Cited

1960

Highly Cited

1960

It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems…