Flow pack facets of the single node fixed-charge flow polytope

Operations Research Letters

Volumn 29, Issue 3, 2001, Pages 107-114

  Atamtürk, Alper ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SOFTWARE; MATHEMATICAL MODELS; PROBLEM SOLVING;

FLOW POLYTOPES;

INTEGER PROGRAMMING;

EID: 0035476152     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00100-6     Document Type: Article

References (14)

1. Capacitated facility location: Valid inequalities and facets
2. Uncapacitated lot sizing: The convex hull of solutions
3. bc-opt: A branch-and-cut code for mixed integer programs
4. Lifted flow cover inequalities for mixed 0-1 integer programs
5. Sequence independent lifting in mixed integer programming
6. The 0-1 knapsack problem with a single continuous variable
7. MINTO, a mixed integer optimizer
8. Valid linear inequalities for fixed charge problems
9. Valid inequalities and separation for capacitated economic lot sizing
10. The complementary class of generalized flow cover inequalities
11. Valid inequalities for mixed 0-1 programs
12. Solving mixed integer programming problems using automatic reformulation
13. Valid inequalities and superadditivity for 0/1 integer programs