The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Airport runway scheduling (Q2393444) (← links)
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (Q2393468) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- An iterative method for solving a bi-objective constrained portfolio optimization problem (Q2419517) (← links)
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem (Q2427438) (← links)
- Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- A hybrid approach for index tracking with practical constraints (Q2438411) (← links)
- Index tracking with fixed and variable transaction costs (Q2439491) (← links)
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints (Q2450736) (← links)
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) (← links)
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models (Q2475837) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- The \(p\)-median problem under uncertainty (Q2477661) (← links)
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
- A fast swap-based local search procedure for location problems (Q2480210) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339) (← links)
- Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
- Load balancing and capacity constraints in a hierarchical location model (Q2490178) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Practical aspects associated with location planning for maternal and perinatal assistance in Brazil (Q2507372) (← links)
- Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)
- The big valley conjecture for the flow Steiner tree problem (Q2515391) (← links)
- A linear risk-return model for enhanced indexation in portfolio optimization (Q2516640) (← links)
- Constraint handling in genetic algorithms: the set partitioning problem (Q2567866) (← links)
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search (Q2567890) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
- A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases (Q2572249) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
- Ordered median problem with demand distribution weights (Q2629911) (← links)
- A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
