The Ring Star problem: Polyhedral analysis and exact algorithmLABBE, Martine; LAPORTE, Gilbert; RODRIGUEZ MARTIN, Inmaculada et al.Networks (New York, NY). 2004, Vol 43, Num 3, pp 177-189, issn 0028-3045, 13 p.Article

A polyhedral study of the cardinality constrained knapsack problemDE FARIAS, I. R; NEMHAUSER, G. L.Mathematical programming. 2003, Vol 96, Num 3, pp 439-467, issn 0025-5610, 29 p.Article

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

A note on the continuous mixing setZHAO, M; DE FARIAS, I. R.Operations research letters. 2008, Vol 36, Num 6, pp 726-733, issn 0167-6377, 8 p.Article

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliverySUBRAMANIAN, Anand; UCHOA, Eduardo; ALVES PESSOA, Artur et al.Operations research letters. 2011, Vol 39, Num 5, pp 338-341, issn 0167-6377, 4 p.Article

New formulations and valid inequalities for a bilevel pricing problemDEWEZ, Sophie; LABBD, Martine; MARCOTTE, Patrice et al.Operations research letters. 2008, Vol 36, Num 2, pp 141-149, issn 0167-6377, 9 p.Article

A branch and cut algorithm for the hierarchical network design problemOBREQUE, Carlos; DONOSO, Macarena; GUTIERREZ, Gabriel et al.European journal of operational research. 2010, Vol 200, Num 1, pp 28-35, issn 0377-2217, 8 p.Article

On the domino-parity inequalities for the STSPBOYD, Sylvia; COCKBURN, Sally; VELLA, Danielle et al.Mathematical programming. 2007, Vol 110, Num 3, pp 501-519, issn 0025-5610, 19 p.Article

A branch-and-cut algorithm for scheduling of projects with variable-intensity activitiesKIS, Tamas.Mathematical programming. 2005, Vol 103, Num 3, pp 515-539, issn 0025-5610, 25 p.Article

The discrete facility location problem with balanced allocation of customersMARIN, Alfredo.European journal of operational research. 2011, Vol 210, Num 1, pp 27-38, issn 0377-2217, 12 p.Article

A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing ProblemSOLYALI, Oguz; SÜRAL, Haldun.Transportation science. 2011, Vol 45, Num 3, pp 335-345, issn 0041-1655, 11 p.Article

Heuristics for the 0―1 multidimensional knapsack problem : Cooperative combinatorial optimizationBOYER, V; ELKIHEL, M; EL BAZ, D et al.European journal of operational research. 2009, Vol 199, Num 3, pp 658-664, issn 0377-2217, 7 p.Article

An algorithmic framework for the exact solution of the prize-collecting steiner tree problemLJUBIC, Ivana; WEISKIRCHER, René; PFERSCHY, Ulrich et al.Mathematical programming. 2006, Vol 105, Num 2-3, pp 427-449, issn 0025-5610, 23 p.Article

Exact MAX-2SAT solution via lift-and-project closureBONAMI, P; MINOUX, M.Operations research letters. 2006, Vol 34, Num 4, pp 387-393, issn 0167-6377, 7 p.Article

Branch-and-cut algorithms for the undirected m-Peripatetic Salesman ProblemDUCHENNE, Eric; LAPORTE, Gilbert; SEMET, Frédéric et al.European journal of operational research. 2005, Vol 162, Num 3, pp 700-712, issn 0377-2217, 13 p.Article

The Generalized Minimum Spanning Tree Problem : Polyhedral analysis and branch-and-cut algorithmFEREMANS, Corinne; LABBE, Martine; LAPORTE, Gilbert et al.Networks (New York, NY). 2004, Vol 43, Num 2, pp 71-86, issn 0028-3045, 16 p.Article

Solving the Close-Enough Arc Routing ProblemMINH HOANG HA; BOSTEL, Nathalie; LANGEVIN, André et al.Networks (New York, NY). 2014, Vol 63, Num 1, pp 107-118, issn 0028-3045, 12 p.Conference Paper

The Multi-commodity Pickup-and-Delivery Traveling Salesman ProblemHERNANDEZ-PEREZ, Hipólito; SALAZAR-GONZALEZ, Juan-José.Networks (New York, NY). 2014, Vol 63, Num 1, pp 46-59, issn 0028-3045, 14 p.Conference Paper

The Orienteering Problem with Variable ProfitsERDOGAN, Güneş; LAPORTE, Gilbert.Networks (New York, NY). 2013, Vol 61, Num 2, pp 104-116, issn 0028-3045, 13 p.Conference Paper

An exact approach to the problem of extracting an embedded network matrixFIGUEIREDO, Rosa M. V; LABBE, Martine; DE SOUZA, Cid C et al.Computers & operations research. 2011, Vol 38, Num 11, pp 1483-1492, issn 0305-0548, 10 p.Article

Models and branch-and-cut algorithms for pickup and delivery problems with time windowsROPKE, Stefan; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.Networks (New York, NY). 2007, Vol 49, Num 4, pp 258-272, issn 0028-3045, 15 p.Conference Paper

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problemYONGPEI GUAN; AHMED, Shabbir; NEMHAUSER, George L et al.Mathematical programming. 2006, Vol 105, Num 1, pp 55-84, issn 0025-5610, 30 p.Article

Combinatorial benders' cuts for mixed-integer linear programmingCODATO, Gianni; FISCHETTI, Matteo.Operations research. 2006, Vol 54, Num 4, pp 756-766, issn 0030-364X, 11 p.Article

A branch-and-cut algorithm for the hub location and routing problemRODRIGUEZ-MARTIN, Inmaculada; SALAZAR-GONZALEZ, Juan-José; YAMAN, Hande et al.Computers & operations research. 2014, Vol 50, pp 161-174, issn 0305-0548, 14 p.Article

The pyramidal capacitated vehicle routing problemLYSGAARD, Jens.European journal of operational research. 2010, Vol 205, Num 1, pp 59-64, issn 0377-2217, 6 p.Article