Result 1 to 20 of 227 total
Mixed-integer linear programming for resource leveling problems. (English)
Eur. J. Oper. Res. 221, No. 1, 27-37 (2012).
1
A cutting plane approach for integrated planning and scheduling. (English)
Comput. Oper. Res. 39, No. 2, 320-327 (2012).
2
A branch-and-cut procedure for the Udine course timetabling problem. (English)
Ann. Oper. Res. 194, 71-87 (2012).
3
Cutting planes cannot approximate some integer programs. (English)
Oper. Res. Lett. 40, No. 4, 272-275 (2012).
4
New results about multi-band uncertainty in robust optimization. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 63-74 (2012).
5
Complexity results for the gap inequalities for the max-cut problem. (English)
Oper. Res. Lett. 40, No. 3, 149-152 (2012).
6
Unique minimal liftings for simplicial polytopes. (English)
Math. Oper. Res. 37, No. 2, 346-355 (2012).
7
Intersection cuts with infinite Split rank. (English)
Math. Oper. Res. 37, No. 1, 21-40 (2012).
8
Boolean function complexity. Advances and frontiers. (English)
Algorithms and Combinatorics 27. Berlin: Springer (ISBN 978-3-642-24507-7/hbk; 978-3-642-24508-4/ebook). xv, 617~p. EUR~64.95/net; SFR~86.50; \sterling~58.99; \$~84.95 (2012).
9
Experiments with two-row cuts from degenerate tableaux. (English)
INFORMS J. Comput. 23, No. 4, 578-590 (2011).
10
Lifted tableaux inequalities for $0$-$1$ mixed-integer programs: a computational study. (English)
INFORMS J. Comput. 23, No. 3, 416-424 (2011).
11
Split rank of triangle and quadrilateral inequalities. (English)
Math. Oper. Res. 36, No. 3, 432-461 (2011).
12
The Chvàtal-Gomory closure of a strictly convex body. (English)
Math. Oper. Res. 36, No. 2, 227-239 (2011).
13
A set partitioning reformulation of a school bus scheduling problem. (English)
J. Sched. 14, No. 4, 307-318 (2011).
14
Valid inequalities, cutting planes and integrality of the knapsack polytope. (English)
J. Interdiscip. Math. 14, No. 4, 389-406 (2011).
15
Globally optimal image partitioning by multicuts. (English)
Boykov, Yuri (ed.) et al., Energy minimization methods in computer vision and pattern recognition. 8th international conference, EMMCVPR 2011, St.~Petersburg, Russia, July 25‒27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23093-6/pbk). Lecture Notes in Computer Science 6819, 31-44 (2011).
16
On maximal $S$-free convex sets. (English)
SIAM J. Discrete Math. 25, No. 1, 379-393 (2011).
17
A new approach to the stable set problem based on ellipsoids. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 223-234 (2011).
18
Design and verify: A new scheme for generating cutting-planes. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 143-155 (2011).
19
Lift-and-project cuts for mixed integer convex programs. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 52-64 (2011).
20
Result 1 to 20 of 227 total
Start
Contact
Print
General Help
