The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- The incremental cooperative design of preventive healthcare networks (Q1730637) (← links)
- Automated generation of constructive ordering heuristics for educational timetabling (Q1730754) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- New valid inequalities for the two-echelon capacitated vehicle routing problem (Q1742205) (← links)
- Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- A mathematical model for fuzzy \(p\)-median problem with fuzzy weights and variables (Q1748500) (← links)
- Introducing capacities in the location of unreliable facilities (Q1751785) (← links)
- On exact and approximate stochastic dominance strategies for portfolio selection (Q1751812) (← links)
- A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- A second-order cone programming approach for linear programs with joint probabilistic constraints (Q1758269) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196) (← links)
- Dichotomous binary differential evolution for knapsack problems (Q1793333) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Parallel local search for Steiner trees in graphs (Q1808193) (← links)
- Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
- An evolutionary heuristic for the index tracking problem. (Q1812009) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- Accelerating the convergence of subgradient optimisation (Q1847153) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- Greedy and local search heuristics for unconstrained binary quadratic programming (Q1850977) (← links)
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- A visual interactive approach to vehicle routing (Q1869906) (← links)
- A genetic algorithm for the vehicle routing problem (Q1870833) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- Two new heuristics for the location set covering problem (Q1893520) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
