(1,k)-configuration facets for the generalized assignment problem
From MaRDI portal
Publication:914550
DOI10.1007/BF01585726zbMath0701.90065MaRDI QIDQ914550
N. E. Zubov, Elsie Sterbin Gottlieb
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)
Related Items
Knapsack polytopes: a survey, Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, A Survey of the Generalized Assignment Problem and Its Applications, The generalized assignment problem: Valid inequalities and facets, Generalized cover facet inequalities for the generalized assignment problem, Minimization of makespan in generalized assignment problem., A computational study of exact knapsack separation for the generalized assignment problem, A new extended formulation of the generalized assignment problem and some associated valid inequalities, A family of inequalities for the generalized assignment polytope, Some integer programs arising in the design of main frame computers
Cites Work
