OR-Library
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- Complementary column generation and bounding approaches for set partitioning formulations
- A new formulation for the conditional p-median and p-center problems
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- A study of the quadratic semi-assignment polytope
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A hybrid optimization approach to index tracking
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Optimal location with equitable loads
- The multiple server center location problem
- The variable radius covering problem
- A flexible model and efficient solution strategies for discrete location problems
- A global continuation algorithm for solving binary quadratic programming problems
- Exemplar-based clustering via simulated annealing
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- Portfolio optimization with an envelope-based multi-objective evolutionary algorithm
- A note of using effective immune based approach for the flow shop scheduling with buffers
- A heuristic for Euclidean and rectilinear Steiner problems
- Enhancing an algorithm for set covering problems
- Solving to optimality the uncapacitated fixed-charge network flow problem
- The generalized shifting bottleneck procedure
- The ODO project: Toward a unified basis for constraint-directed scheduling
- A genetic algorithm for the multidimensional knapsack problem
- Relaxation heuristics for a generalized assignment problem
- A tree search algorithm for the crew scheduling problem
- Simple Lagrangian heuristic for the set covering problem
- Vehicle routing with a sparse feasibility graph
- Computational experience with approximation algorithms for the set covering problem
- Driving tabu search with case-based reasoning
- CAGE
- A simulated annealing code for general integer linear programs
- A tabu search approach to the uncapacitated facility location problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- The return plant location problem: Modelling and resolution
- Stabilized column generation
- Integer optimization by local search. A domain-independent approach
- Separating lifted odd-hole inequalities to solve the index selection problem
- An algorithm for the 2D guillotine cutting stock problem
- Hyperheuristics
- iOpt
- Isolde
- MALLBA
- Microlay
- MADAM
- GAMS.jl
- Packlib2
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- QAPLIB
- Delaunay.jl
- NCNBD.jl
- SOS-SDP
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- SPG
- Solving large set covering problems for crew scheduling
- TSPACK
- TSPLIB
- Location and layout planning. A survey
- VRPH
- A parallel interior point method and its application to facility location problems
- GRASP
- PERL
- A dynamic programming based algorithm for the crew scheduling problem.
- Upper and lower bounds for the single source capacitated location problem.
- A contribution to the stochastic flow shop scheduling problem.
- Solving the simple plant location problem using a data correcting approach
- An efficient genetic algorithm for the \(p\)-median problem
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- Effective algorithm and heuristic for the generalized assignment problem.
- Branch and peg algorithms for the simple plant location problem.
- Preprocessing and cutting for multiple allocation hub location problems.
- The multidimensional 0-1 knapsack problem: an overview.
- A column generation approach to capacitated p-median problems
- PALS
- RAMP
- TABARIS
- CLAIRE
- J-MEANS
- MOTGA
- EVE-OPT
- GASUB
- ABACUS
- COMET
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- QUAD01
- Digital data networks design using genetic algorithms
- A statistical analysis of simulated annealing applied to the p-median problem
- A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro
- A parallel genetic algorithm to solve the set-covering problem
- Parallel genetic algorithm with parameter adaptation
- A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- SteinLib
- CPLEX
- GALib
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
This page was built for software: OR-Library
