The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
- The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- Digital data networks design using genetic algorithms (Q1590811) (← links)
- A statistical analysis of simulated annealing applied to the \(p\)-median problem (Q1593521) (← links)
- A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro (Q1600932) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- Parallel genetic algorithm with parameter adaptation (Q1603579) (← links)
- A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem (Q1615960) (← links)
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (Q1616250) (← links)
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- A two-stage approach to the UCITS-constrained index-tracking problem (Q1634070) (← links)
- A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
- Minimizing deviation from scheduled times in a single mixed-operation runway (Q1652073) (← links)
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- Minimizing the tracking error of cardinality constrained portfolios (Q1652503) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
- Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics (Q1653958) (← links)
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- Compact MILP formulations for the \(p\)-center problem (Q1661850) (← links)
- A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Optimal construction and rebalancing of index-tracking portfolios (Q1694362) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction (Q1708730) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
- GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
