Narrow search
Showing 1 - 7 of 7
Cover Image
Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP
Vazacopoulos, Alkis; Verma, Nitin - In: Supply chain optimization, (pp. 391-413). 2005
Persistent link: https://www.econbiz.de/10003332440
Cover Image
Solving hard mixed-integer programming problems with Xpress-MP : a MIPLIB 2003 case study
Laundy, Richard; Perregaard, Michael; Tavares, Gabriel; … - In: INFORMS journal on computing : JOC 21 (2009) 2, pp. 304-313
Persistent link: https://www.econbiz.de/10003858710
Cover Image
The perfectly matchable subgraph polytope of an arbitrary graph
Balas, Egon; Pulleyblank, William R. - 1987
Persistent link: https://www.econbiz.de/10000730057
Cover Image
On the cycle polytope of a directed graph and its relaxations
Balas, Egon; Stephan, Rüdiger - In: Operations research proceedings 2006 : selected papers …, (pp. 203-208). 2007
Persistent link: https://www.econbiz.de/10003470684
Cover Image
Combining lift-and-project and reduce-and-split
Balas, Egon; Cornuéjols, Gérard; Kis, Tamás; … - In: INFORMS journal on computing : JOC 25 (2013) 3, pp. 475-487
Persistent link: https://www.econbiz.de/10009784063
Cover Image
Intersection cuts from multiple rows : a disjunctive programming approach
Balas, Egon; Qualizza, Andrea - In: EURO journal on computational optimization 1 (2013) 1/2, pp. 3-49
Persistent link: https://www.econbiz.de/10010394199
Cover Image
When lift-and-project cuts are different
Balas, Egon; Serra, Thiago - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 822-834
Persistent link: https://www.econbiz.de/10012294742