The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Equally weighted cardinality constrained portfolio selection via factor models (Q2228417) (← links)
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (Q2231331) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results (Q2256276) (← links)
- Order and static stability into the strip packing problem (Q2259026) (← links)
- Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
- A pure quasi-human algorithm for solving the cuboid packing problem (Q2267001) (← links)
- An exact algorithm for the type-constrained and variable sized bin packing problem (Q2267302) (← links)
- A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
- Heuristic algorithms for the cardinality constrained efficient frontier (Q2275807) (← links)
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- Methods for solving of the aircraft landing problem. II: Approximate solution methods (Q2289042) (← links)
- A generic exact solver for Vehicle Routing and related problems (Q2293094) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
- A two-phase approach for single container loading with weakly heterogeneous boxes (Q2312435) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- The incremental connected facility location problem (Q2329719) (← links)
- Methods for solving of the aircraft landing problem. I: Exact solution methods (Q2331478) (← links)
- An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
- Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
- Linear vs. quadratic portfolio selection models with hard real-world constraints (Q2355713) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
- A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
- Benchmarks for basic scheduling problems (Q2366085) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- A novel differential evolution algorithm for binary optimization (Q2376130) (← links)
- Clustering with or without the approximation (Q2377383) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- A caving degree approach for the single container loading problem (Q2378453) (← links)
- An improved ant colony optimization for vehicle routing problem (Q2378461) (← links)
- Mixed-integer programming approaches for index tracking and enhanced indexation (Q2378489) (← links)
- A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
- A neural model for the \(p\)-median problem (Q2384886) (← links)
- BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- A new method for mean-variance portfolio optimization with cardinality constraints (Q2393351) (← links)
