The following pages link to OR-Library (Q16337):
Displaying 50 items.
- A heuristic for the Steiner problem in graphs (Q1918915) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
- Concatenation-based greedy heuristics for the Euclidean Steiner tree problem (Q1961044) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← links)
- Cooperative multiobjective optimization with bounds on objective functions (Q2022239) (← links)
- The double-assignment plant location problem with co-location (Q2026959) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- Optimizing facility location and design (Q2028796) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Stochastic single-allocation hub location (Q2029287) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem (Q2031353) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
- Modeling the capacitated \(p\)-cable trench problem with facility costs (Q2045638) (← links)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems (Q2056575) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
- Gompertz PSO variants for knapsack and multi-knapsack problems (Q2076716) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse (Q2097658) (← links)
- Non-convex nested Benders decomposition (Q2097672) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- A novel decomposition approach to set covering problems by exploiting special structures (Q2113818) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
- The hub location and pricing problem (Q2140288) (← links)
- Set covering problem with conflict constraints (Q2147026) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
- A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← links)
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- A novel hybrid algorithm for minimizing total weighted tardiness cost (Q2209506) (← links)
- Solving the quadratic assignment problem (Q2215269) (← links)
