The following pages link to Geraldo Robson Mateus (Q340328):
Displayed 50 items.
- (Q297188) (redirect page) (← links)
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- The pickup and delivery problem with cross-docking (Q340329) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- Heuristics for distribution network design in telecommunication (Q556715) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Corrigendum to: ``Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines'' (Q670412) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- (Q858258) (redirect page) (← links)
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547) (← links)
- A scheduling problem with unrelated parallel machines and sequence dependent setups (Q973463) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
- Exact sequential choice of locations in a network (Q1290143) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- A branch-and-bound algorithm to solve a multi-level network optimization problem (Q1398020) (← links)
- Optimal network design for wireless local area network (Q1599321) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- Bi-objective data gathering path planning for vehicles with bounded curvature (Q1652333) (← links)
- Compact and extended formulations for the virtual network embedding problem (Q1742226) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- Simulation and analysis of a new mobility model for mobile communication networks (Q1854772) (← links)
- Model and heuristic for a generalized access network design problem (Q1865086) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- Operations research at bulk terminal: a parallel column generation approach (Q2093922) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
- GRASP with Path-Relinking for Facility Layout (Q2820115) (← links)
- Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized (Q2840529) (← links)
- The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks (Q2840531) (← links)
- A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking (Q2840717) (← links)
- Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem (Q2840729) (← links)
- Optimization in Designing Complex Communication Networks (Q2913773) (← links)
- A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking (Q3091524) (← links)
- Dominance Criteria for the Capacitated Warehouse Location Problem (Q3211102) (← links)
- Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)
- (Q4229631) (← links)
- (Q4428478) (← links)
- Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
- Storage Yard Management: Modelling and Solving (Q5111125) (← links)
- (Q5294054) (← links)
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (Q5432690) (← links)
- Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
- Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
- Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem (Q6357616) (← links)
- A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure (Q6386533) (← links)