Similar Search Results

The stable set problem : clique and nodal inequalities revisited

Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano - In: Computers & operations research : and their … 123 (2020), pp. 1-16

Persistent link: https://www.econbiz.de/10012286300

Solving large Steiner Triple Covering Problems

Ostrowski, James; Linderoth, Jeff; Rossi, Fabrizio; … - In: Operations research letters 39 (2011) 2, pp. 127-131

Persistent link: https://www.econbiz.de/10009010679

A Lagrangian heuristic for satellite range scheduling with resource constraints

Marinelli, Fabrizio; Nocella, Salvatore; Rossi, Fabrizio; … - In: Computers & operations research : and their … 38 (2011) 11, pp. 1572-1583

Persistent link: https://www.econbiz.de/10008987425

Pricing multiple exercise American options by linear programming

Giandomenico, Monia; Pınar, Mustafa Ç. - In: Optimal financial decision making under uncertainty, (pp. 137-150). 2017

Persistent link: https://www.econbiz.de/10011558445

A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

Letchford, Adam N.; Lysgaard, Jens; Eglese, Richard W. - Ehrvervøkonomisk Institut, Institut for Økonomi - 2006

In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on...

Persistent link: https://www.econbiz.de/10005626769