The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Minimum cost multicast routing using ant colony optimization algorithm (Q473657) (← links)
- The maximin gradual cover location problem (Q480773) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Chance constrained \(0-1\) quadratic programs using copulas (Q499685) (← links)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
- Hub location-allocation in intermodal logistic networks (Q531438) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization (Q621968) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Parameter tuning for local-search-based matheuristic methods (Q680781) (← links)
- A sparse enhanced indexation model with chance and cardinality constraints (Q683716) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem (Q702730) (← links)
- A meta-heuristic with orthogonal experiment for the set covering problem (Q702766) (← links)
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- On scheduling around large restrictive common due windows (Q704121) (← links)
- Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- Multiobjective optimization for multimode transportation problems (Q721075) (← links)
- Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726] (Q732917) (← links)
- Evolutionary model for the Steiner tree problem with flow-dependent weights (Q733992) (← links)
- One approach to solving a discrete production planning problem with interval data (Q735645) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application (Q780129) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Scatter search and bionomic algorithms for the aircraft landing problem (Q817534) (← links)
