Similar Search Results

Solving the geometric firefighter routing problem via integer programming

Zambon, Mauricio J. O.; Rezende, Pedro J. de; Souza, … - In: European journal of operational research : EJOR 274 (2019) 3, pp. 1090-1101

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

Finding exact solutions for the Geometric Firefighter Problem in practice

Zambon, Mauricio J. O.; Rezende, Pedro J. de; Souza, … - In: Computers & operations research : and their … 97 (2018), pp. 72-83

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

Optimal area polygonization problems : exact solutions through geometric duality

Ramos, Natanael; Rezende, Pedro J. de; Souza, Cid … - In: Computers & operations research : and their … 145 (2022), pp. 1-10

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

Improved bounds for the traveling umpire problem : a stronger formulation and a relax-and-fix heuristic

Oliveira, Lucas de; Souza, Cid Carvalho de; Yunes, Tallys - In: European journal of operational research : EJOR 236 (2014) 2, pp. 592-600

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

Lower bounds for large traveling umpire instances : new valid inequalities and a branch-and-cut algorithm

Oliveira, Lucas de; Souza, Cid Carvalho de; Yunes, Tallys - In: Computers & operations research : and their … 72 (2016), pp. 147-159

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

A branch-and-price approach for the partition coloring problem

Hoshino, Edna A.; Frota, Yuri A.; Souza, Cid Carvalho de - In: Operations research letters 39 (2011) 2, pp. 132-137

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

A Relax-and-Cut algorithm for the set partitioning problem

Cavalcante, Victor F.; Souza, Cid Carvalho de; Lucena, … - In: Computers & operations research : and their … 35 (2008) 6, pp. 1963-1981

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

Integer programming approaches for minimum stabbing problems

Piva, Breno; Souza, Cid Carvalho de; Frota, Yuri; … - In: RAIRO / Operations research 48 (2014) 2, pp. 211-233

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

Minimum stabbing rectangular partitions of rectilinear polygons

Piva, Breno; Souza, Cid Carvalho de - In: Computers & operations research : and their … 80 (2017), pp. 184-197

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

Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic

de Oliveira, Lucas; Souza, Cid C. de; Yunes, Tallys - In: European Journal of Operational Research 236 (2014) 2, pp. 592-600

Given a double round-robin tournament, the traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during the tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that...

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