The following pages link to Ana Paias (Q301386):
Displayed 16 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern (Q319599) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- Solving the family traveling salesman problem (Q723922) (← links)
- Corrigendum to: ``Solving the family traveling salesman problem'' (Q2239977) (← links)
- A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern (Q2355861) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem (Q2459391) (← links)
- An Integrated Vehicle-Crew-Roster Problem with Days-Off Pattern (Q5232823) (← links)
- A metaheuristic approach to fisheries survey route planning (Q5278221) (← links)
- Metaheuristics based on decision hierarchies for the traveling purchaser problem (Q5374520) (← links)
- The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
- Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)