The following pages link to (Q3274590):
Displayed 13 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Further results on the probabilistic traveling salesman problem (Q2368298) (← links)
- Recursive branch and bound (Q3693268) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)