The generalized assignment problem: Valid inequalities and facets
Data up to Jan 2025
Total Citations Per Year
Abstract
References (35)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Linear Programming and Extensions
1963 • 5,853 citations
Combinatorial optimization: networks and matroids
2021 • 3,410 citations
Linear Programming and Extensions
1963 • 2,647 citations
Solving Large-Scale Zero-One Linear Programming Problems
1983 • 675 citations
On the facial structure of set packing polyhedra
1973 • 588 citations
A branch and bound algorithm for the generalized assignment problem
1975 • 465 citations
Facets of the knapsack polytope
1975 • 397 citations
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
1987 • 391 citations
Resource constrained scheduling as generalized bin packing
1976 • 341 citations
A Cutting Plane Algorithm for the Linear Ordering Problem
1984 • 316 citations
Faces for a linear inequality in 0–1 variables
1975 • 304 citations
Facets of the Knapsack Polytope From Minimal Covers
1978 • 202 citations
AN ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEM
1981 • 177 citations
Facet of regular 0–1 polytopes
1975 • 166 citations
Recent Results in the Theory of Machine Scheduling
1983 • 153 citations
Modeling Facility Location Problems as Generalized Assignment Problems
1977 • 134 citations
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
1985 • 116 citations
Technical Note—A Note on Zero-One Programming
1975 • 115 citations
Facets and strong valid inequalities for integer programs
1976 • 101 citations
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
1983 • 100 citations
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
1983 • 93 citations
Valid Inequalities and Superadditivity for 0–1 Integer Programs
1977 • 92 citations
An all Zero-One Algorithm for a Certain Class of Transportation Problems
1971 • 91 citations
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
1976 • 89 citations
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
1990 • 82 citations
Lifting the facets of zero–one polytopes
1978 • 82 citations
(1,k)-configurations and facets for packing problems
1980 • 76 citations
An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
1976 • 76 citations
An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
1973 • 62 citations
Optimal triangulation of large real world input-output matrices
1983 • 39 citations
(1,k)-configuration facets for the generalized assignment problem
1990 • 22 citations
Properties of Facets of Binary Polytopes
1977 • 20 citations
Concepts and Computing Procedures for Certain X Programming Problems
1954 • 9 citations
Deleted Work
1955 • 0 citations