The following pages link to Ramón Alvarez-Valdés (Q238084):
Displayed 43 items.
- Item:Q238084 (redirect page) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- Item:Q238084 (redirect page) (← links)
- Assigning students to course sections using tabu search (Q1593516) (← links)
- Design and implementation of a course scheduling system using Tabu Search (Q1600861) (← links)
- Solving a large multicontainer loading problem in the car manufacturing industry (Q1652277) (← links)
- New exact methods for the time-invariant berth allocation and quay crane assignment problem (Q1711448) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- A tabu search algorithm for the pallet loading problem (Q1764209) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer (Q1820682) (← links)
- A tabu search algorithm for assigning teachers to courses. (Q1871419) (← links)
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems (Q1871643) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
- Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- GRASP and path relinking for project scheduling under partially renewable resources (Q2482792) (← links)
- A scatter search algorithm for project scheduling under partially renewable resources (Q2491335) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm (Q2668804) (← links)
- The pallet-loading vehicle routing problem with stability constraints (Q2672112) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- (Q2783480) (← links)
- Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
- GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem (Q2892334) (← links)
- A Maximal-Space Algorithm for the Container Loading Problem (Q2901024) (← links)
- Labour scheduling at an airport refuelling installation (Q3157314) (← links)
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems (Q4679787) (← links)
- (Q5323555) (← links)
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
- Models and algorithms for a yard crane scheduling problem in container ports (Q6167632) (← links)