The following pages link to OR-Library (Q16337):
Displaying 50 items.
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
- The stochastic \(p\)-hub center problem with service-level constraints (Q833535) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- A facility location model for logistics systems including reverse flows: the case of remanufacturing activities (Q850279) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- The gravity \(p\)-median model (Q864043) (← links)
- A genetic algorithm for the \(p\)-median problem with pos/neg weights (Q865554) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- Cardinal: a finite sets constraint solver (Q879977) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
- Efficient implementation of an active set algorithm for large-scale portfolio selection (Q925841) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- A new heuristic algorithm for cuboids packing with no orientation constraints (Q954042) (← links)
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
- The multi-period incremental service facility location problem (Q960382) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- An improved constraint satisfaction adaptive neural network for job-shop scheduling (Q969749) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
