| Year |
Citation |
Score |
| 2018 |
Nguyen TT, Richard JP, Tawarmalani M. Deriving convex hulls through lifting and projection Mathematical Programming. 169: 377-415. DOI: 10.1007/S10107-017-1138-3 |
0.677 |
|
| 2017 |
Davarnia D, Richard JP, Tawarmalani M. Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction Siam Journal On Optimization. 27: 1801-1833. DOI: 10.1137/16M1066166 |
0.668 |
|
| 2016 |
Arslan AN, Richard JP, Guan Y. On the polyhedral structure of two‐level lot‐sizing problems with supplier selection Naval Research Logistics. 63: 647-666. DOI: 10.1002/Nav.21725 |
0.379 |
|
| 2013 |
Le T, Diabat A, Richard JP, Yih Y. A column generation-based heuristic algorithm for an inventory routing problem with perishable goods Optimization Letters. 7: 1481-1502. DOI: 10.1007/S11590-012-0540-2 |
0.611 |
|
| 2013 |
Diabat A, Richard JP, Codrington CW. A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design Annals of Operations Research. 203: 55-80. DOI: 10.1007/S10479-011-0915-2 |
0.596 |
|
| 2013 |
Chung K, Richard JP, Tawarmalani M. Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets Mathematical Programming. 145: 403-450. DOI: 10.1007/S10107-013-0652-1 |
0.661 |
|
| 2013 |
Tawarmalani M, Richard JP, Xiong C. Explicit convex and concave envelopes through polyhedral subdivisions Mathematical Programming. 138: 531-577. DOI: 10.1007/S10107-012-0581-4 |
0.701 |
|
| 2011 |
Zeng B, Richard JP. A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting Discrete Optimization. 8: 277-301. DOI: 10.1016/J.Disopt.2010.09.005 |
0.612 |
|
| 2011 |
Zeng B, Richard JP. A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting Discrete Optimization. 8: 259-276. DOI: 10.1016/J.Disopt.2010.09.004 |
0.615 |
|
| 2010 |
Tawarmalani M, Richard JP, Chung K. Strong valid inequalities for orthogonal disjunctions and bilinear covering sets Mathematical Programming. 124: 481-512. DOI: 10.1007/S10107-010-0374-6 |
0.7 |
|
| 2010 |
Dey SS, Richard JP. Relations between facets of low- and high-dimensional group problems Mathematical Programming. 123: 285-313. DOI: 10.1007/S10107-009-0303-8 |
0.661 |
|
| 2010 |
Richard JP, Tawarmalani M. Lifting inequalities: a framework for generating strong cuts for nonlinear programs Mathematical Programming. 121: 61-104. DOI: 10.1007/S10107-008-0226-9 |
0.691 |
|
| 2009 |
Dey SS, Richard JP. Linear-programming-based lifting and its application to primal cutting-plane algorithms Informs Journal On Computing. 21: 137-150. DOI: 10.1287/Ijoc.1080.0284 |
0.648 |
|
| 2009 |
Dey SS, Richard JP, Li Y, Miller LA. On the extreme inequalities of infinite group problems Mathematical Programming. 121: 145-170. DOI: 10.1007/S10107-008-0229-6 |
0.677 |
|
| 2009 |
Richard JP, Li Y, Miller LA. Valid inequalities for MIPs and group polyhedra from approximate liftings Mathematical Programming. 118: 253-277. DOI: 10.1007/S10107-007-0190-9 |
0.456 |
|
| 2008 |
Dey SS, Richard JP. Facets of Two-Dimensional Infinite Group Problems Mathematics of Operations Research. 33: 140-166. DOI: 10.1287/Moor.1070.0283 |
0.669 |
|
| 2008 |
Li Y, Richard JP. Cook, Kannan and Schrijver’s example revisited Discrete Optimization. 5: 724-734. DOI: 10.1016/J.Disopt.2008.05.002 |
0.334 |
|
| 2008 |
Miller LA, Li Y, Richard JP. New inequalities for finite and infinite group problems from approximate lifting Naval Research Logistics. 55: 172-191. DOI: 10.1002/Nav.20275 |
0.44 |
|
| 2003 |
Richard JP, Farias IRd, Nemhauser GL. A simplex-based algorithm for 0-1 mixed integer programming Lecture Notes in Computer Science. 2570: 158-170. DOI: 10.1007/3-540-36478-1_15 |
0.564 |
|
| Show low-probability matches. |