The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm (Q260652) (← links)
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- The quintile share ratio in location analysis (Q296717) (← links)
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- \(p\)-facility Huff location problem on networks (Q323476) (← links)
- A compact linearisation of Euclidean single allocation hub location problems (Q325380) (← links)
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- Local search heuristics for the mobile facility location problem (Q337654) (← links)
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- A leader-follower model for discrete competitive facility location (Q342067) (← links)
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- MineLib: a library of open pit mining problems (Q363555) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints (Q367235) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Coloured Petri net scheduling models: Timed state space exploration shortages (Q426116) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
