Geraldo R. Mauri

According to our database1, Geraldo R. Mauri authored at least 26 papers between 2007 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
New approaches for the traffic counting location problem.
Expert Syst. Appl., 2019

Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints.
European Journal of Operational Research, 2019

A Network Flow Based Construction for a GRASP + SA Algorithm to Solve the University Timetabling Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

A MILP Model and a GRASP Algorithm for the Helicopter Routing Problem with Multi-Trips and Time Windows.
Proceedings of the Computational Logistics - 10th International Conference, 2019

2018
A Clustering Search Metaheuristic for the Bi-objective Flexible Job Shop Scheduling Problem.
Proceedings of the XLIV Latin American Computer Conference, 2018

2017
Neighborhood Analysis on the University Timetabling Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem.
Computers & OR, 2016

A mathematical model and a Clustering Search metaheuristic for planning the helicopter transportation of employees to the production platforms of oil and gas.
Computers & Industrial Engineering, 2016

Berth allocation in an ore terminal with demurrage, despatch and maintenance.
Computers & Industrial Engineering, 2016

2014
Hybrid heuristics based on column generation with path-relinking for clustering problems.
Expert Syst. Appl., 2014

A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem.
European Journal of Operational Research, 2014

2013
Evaluation of a simulated annealing metaheuristic to solve a forest planning problem.
IJAOM, 2013

2012
Clustering Search for the Berth Allocation Problem.
Expert Syst. Appl., 2012

A comparison of three metaheuristics for the workover rig routing problem.
European Journal of Operational Research, 2012

A column generation approach for the unconstrained binary quadratic programming problem.
European Journal of Operational Research, 2012

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem.
Computers & OR, 2012

Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011
A lagrangean decomposition for the maximum independent set problem applied to map labeling.
Operational Research, 2011

Lagrangean decompositions for the unconstrained binary quadratic programming problem.
ITOR, 2011

A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields.
Computers & Industrial Engineering, 2011

A Memetic Algorithm for a Continuous case of the Berth Allocation Problem.
Proceedings of the ECTA and FCTA 2011, 2011

2010
A Grasp with Path-Relinking for the Workover Rig Scheduling Problem.
IJNCR, 2010

A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem.
Computers & OR, 2010

2009
Customers' satisfaction in a dial-a-ride problem.
IEEE Intell. Transport. Syst. Mag., 2009

2008
A Hybrid Column Generation Approach for the Berth Allocation Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007
A new hybrid heuristic for driver scheduling.
Int. J. Hybrid Intell. Syst., 2007


  Loading...