The following pages link to OR-Library (Q16337):
Displaying 50 items.
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- A new formulation for the conditional \(p\)-median and \(p\)-center problems (Q1003500) (← links)
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- A hybrid optimization approach to index tracking (Q1026552) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- The multiple server center location problem (Q1026602) (← links)
- The variable radius covering problem (Q1027534) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- Portfolio optimization with an envelope-based multi-objective evolutionary algorithm (Q1042208) (← links)
- A note of using effective immune based approach for the flow shop scheduling with buffers (Q1045843) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- The ODO project: Toward a unified basis for constraint-directed scheduling (Q1268843) (← links)
- A genetic algorithm for the multidimensional knapsack problem (Q1273651) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- A tree search algorithm for the crew scheduling problem (Q1278340) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- Vehicle routing with a sparse feasibility graph (Q1278726) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- Driving tabu search with case-based reasoning (Q1280158) (← links)
- A simulated annealing code for general integer linear programs (Q1290124) (← links)
- A tabu search approach to the uncapacitated facility location problem (Q1290130) (← links)
- Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171) (← links)
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← links)
- The return plant location problem: Modelling and resolution (Q1291663) (← links)
- Stabilized column generation (Q1297485) (← links)
- Integer optimization by local search. A domain-independent approach (Q1301506) (← links)
- Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
- An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures (Q1342071) (← links)
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- A parallel interior point method and its application to facility location problems (Q1380725) (← links)
- A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- A contribution to the stochastic flow shop scheduling problem. (Q1410626) (← links)
- Solving the simple plant location problem using a data correcting approach (Q1411330) (← links)
- An efficient genetic algorithm for the \(p\)-median problem (Q1413747) (← links)
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. (Q1417487) (← links)
