A family of inequalities for the generalized assignment polytope-Reference-Cited by-同舟云学术

A family of inequalities for the generalized assignment polytope

Published:2001-09 Issue:2 Volume:29 Page:49-55
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

de Farias I.R.,Nemhauser G.L.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference12 articles.

1. A survey of algorithms for the generalized assignment problem;Cattrysse;Eur. J. Oper. Res.,1992

2. I.R. de Farias, A polyhedral approach to combinatorial complementarity problems, Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1995.

3. A generalized assignment problem with special ordered sets: a polyhedral approach;de Farias;Math. Programming,2000

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. The generalized assignment problem: valid inequalities and facets;Gottlieb;Math. Programming,1990

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An intelligent stochastic optimization approach for stochastic order allocation problems with high-dimensional order uncertainties;Computers & Industrial Engineering;2022-05

2. Multistage Production and Distribution Planning Problems;Operations Planning;2014-09-18

3. A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem;IEEE Access;2013

4. The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints;Mathematical Programming;2012-02-17

5. Generalized cover facet inequalities for the generalized assignment problem;Optimization;2010-02