The following pages link to OR-Library (Q16337):
Displaying 15 items.
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- MineLib: a library of open pit mining problems (Q363555) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- The multi-period incremental service facility location problem (Q960382) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Ordered median problem with demand distribution weights (Q2629911) (← links)
- ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE (Q3103655) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
