Narrow search
Showing 1 - 10 of 34
Cover Image
Lifted tableaux inequalities for 0-1 mixed-integer programs : a computational study
Narisetty, Amar K.; P. Richard, Jean-Philippe; … - In: INFORMS journal on computing : JOC 23 (2011) 3, pp. 416-424
Persistent link: https://www.econbiz.de/10009296297
Cover Image
An integrated supply chain problem : a nested lagrangian relaxation approach
Diabat, Ali; Richard, Jean-Philippe P. - 2015
Persistent link: https://www.econbiz.de/10011284422
Cover Image
A two model solution approach for the monthly coal train reservations planning problem
Içyüz, I. Ece; Richard, Jean-Philippe P.; Eskigun, Erdem - In: Transportation science : a journal of the Institute for … 50 (2016) 3, pp. 926-946
Persistent link: https://www.econbiz.de/10011550366
Cover Image
Network models with unsplittable node flows with application to unit train scheduling
Davarnia, Danial; Richard, Jean-Philippe P.; Içyüz-Ay, Ece - In: Operations research 67 (2019) 4, pp. 1053-1068
Persistent link: https://www.econbiz.de/10012062916
Cover Image
Solving sparse separable bilinear programs using lifted bilinear cover inequalities
Gu, Xiaoyi; Dey, Santanu S.; Richard, Jean-Philippe P. - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 3, pp. 884-899
Persistent link: https://www.econbiz.de/10014634782
Cover Image
Facets of two-dimensional infinite group problems
Dey, Santanu S.; Richard, Jean-Philippe P. - In: Mathematics of operations research 33 (2008) 1, pp. 140-166
Persistent link: https://www.econbiz.de/10003687633
Cover Image
Smart predict-then-optimize for two-stage linear programs with side information
Estes, Alexander S.; Richard, Jean-Philippe P. - In: INFORMS journal on optimization 5 (2023) 3, pp. 295-320
Persistent link: https://www.econbiz.de/10014328149
Cover Image
Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut
Miller, Andrew J.; Nemhauser, George L.; Savelsbergh, … - 2000
Persistent link: https://www.econbiz.de/10001529861
Cover Image
A multi-item production planning model with setup times : algorithms, reformulations, and polyhedral characterizations for a special case
Miller, Andrew J.; Nemhauser, George L.; Savelsbergh, … - 2001
Persistent link: https://www.econbiz.de/10001573365
Cover Image
A polynomial algorithm for the max cut problem on graphs without long odd cycles
Grötschel, Martin; Nemhauser, George L. - 1982
Persistent link: https://www.econbiz.de/10000420033