The knapsack problem: A survey

Partitioning procedures for solving mixed-variables programming problems

1962 • 3,587 citations

Applied Dynamic Programming.

1964 • 2,240 citations

A Linear Programming Approach to the Cutting-Stock Problem

1961 • 1,976 citations

An Automatic Method for Solving Discrete Programming Problems

2009 • 1,953 citations

Branch-and-Bound Methods: A Survey

1966 • 1,915 citations

Applied Dynamic Programming

1962 • 1,878 citations

An Automatic Method of Solving Discrete Programming Problems

1960 • 1,734 citations

Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

1963 • 1,255 citations

A Linear Programming Approach to the Cutting Stock Problem—Part II

1963 • 1,088 citations

An Algorithm for the Traveling Salesman Problem

1963 • 1,029 citations

An Appraisal of Some Shortest-Path Algorithms

1969 • 999 citations

Principles of Operations Research.

1970 • 900 citations

Discrete-Variable Extremum Problems

1957 • 866 citations

Multistage Cutting Stock Problems of Two and More Dimensions

1965 • 794 citations

Integer Programming and Network Flows.

1970 • 709 citations

The Theory and Computation of Knapsack Functions

1966 • 609 citations

Boolean Methods in Operations Research and Related Areas

1968 • 522 citations

Three Problems in Rationing Capital

1955 • 478 citations

Mathematical Programming and the Analysis of Capital Budgeting Problems.

1964 • 409 citations

Mathematical Programming and the Analysis of Capital Budgeting Problems.

1965 • 395 citations

Capital Budgeting of Interrelated Projects: Survey and Synthesis

1966 • 292 citations

Some continuous functions related to corner polyhedra

1972 • 251 citations

Discrete Dynamic Programming and Capital Allocation

1969 • 230 citations

A Branch and Bound Algorithm for the Knapsack Problem

1967 • 203 citations

ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS

1965 • 196 citations

Investment and Discount Rates Under Capital Rationing--A Programming Approach

1965 • 163 citations

On the Partition of Numbers

1896 • 163 citations

Surrogate Constraints

1968 • 152 citations

Direct Search Algorithms for Zero-One and Mixed-Integer Programming

1967 • 112 citations

A Branch Search Algorithm for the Knapsack Problem

1970 • 87 citations

A Model of Capital Budgeting Under Risk

1966 • 85 citations

Some Applications of the Theory of Dynamic Programming—A Review

1954 • 83 citations

Generalized Lagrange Multipliers in Integer Programming

1971 • 74 citations

Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem

1968 • 73 citations

A Chance-Constrained Approach to Capital Budgeting with Portfolio Type Payback and Liquidity Constraints and Horizon Posture Controls

1967 • 69 citations

Transformation of integer programs to knapsack problems

1971 • 69 citations

An Enumeration Algorithm for Knapsack Problems

1970 • 64 citations

Searching for the Multiplier in One-Constraint Optimization Problems

1970 • 64 citations

A Finite Renewal Algorithm for the Knapsack and Turnpike Models

1967 • 63 citations

An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital Budgeting

1968 • 50 citations

Notes on the theory of dynamic programming IV ‐ Maximization over discrete sets

1956 • 46 citations

A Method for Allocating Funds to Investment Projects when Returns are Subject to Uncertainty

1964 • 46 citations

Duality in Discrete Programming: II. The Quadratic Case

1969 • 37 citations

Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method

1966 • 29 citations

Integer Programming over a Finite Additive Group

1969 • 29 citations

The M-Server Queue with Poisson Input and Gamma-Distributed Service of Order Two

1966 • 23 citations

Shortest Route Methods for Finite State Space Deterministic Dynamic Programming Problems

1968 • 21 citations

A Survey of Integer Programming Emphasizing Computation and Relations among Models

1973 • 20 citations

A Model for Corporate Debt Maturity Decisions

1976 • 16 citations

Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions

1971 • 16 citations

Mixed-integer Algorithms for the (0,1) Knapsack Problem

1972 • 13 citations

An algorithm for the computation of knapsack functions

1969 • 13 citations

An Approach to Zero-One Integer Programming

1968 • 11 citations

Capital Budgeting and Mixed Zero-One Integer Programming

1970 • 10 citations