The following pages link to OR-Library (Q16337):
Displaying 50 items.
- (Q2987350) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- MIP Modeling of Incremental Connected Facility Location (Q3091533) (← links)
- A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation (Q3091534) (← links)
- ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE (Q3103655) (← links)
- Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
- (Q3117021) (← links)
- Teaching meta-heuristics within virtual learning environments (Q3156290) (← links)
- Solving the Hub location problem in telecommunication network design: A local search approach (Q3156824) (← links)
- Efficient solution of large scale, single-source, capacitated plant location problems (Q3157323) (← links)
- Organization of parallel calculations in some problems of discrete optimization (Q3161953) (← links)
- Ant colony optimisation with parameterised search space for the job shop scheduling problem (Q3163736) (← links)
- A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization (Q3174787) (← links)
- A Nested Decomposition Approach for a Large Scale Set Covering Problem: A Model with a Variety of Applications in Industry 4.0 (Q3299233) (← links)
- An empirical study of hybrid genetic algorithms for the set covering problem (Q3372520) (← links)
- Dual-Optimal Inequalities for Stabilized Column Generation (Q3391991) (← links)
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing (Q3392097) (← links)
- Measuring the Performance of Parallel Metaheuristics (Q3424821) (← links)
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem (Q3430248) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- (Q3500140) (← links)
- (Q3515603) (← links)
- Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions (Q3519367) (← links)
- A survey of effective heuristics and their application to a variety of knapsack problems (Q3524431) (← links)
- A Constructive Hybrid Algorithm for Crew Pairing Optimization (Q3541830) (← links)
- An In-Out Approach to Disjunctive Optimization (Q3569927) (← links)
- Constraint-Based Local Search for Constrained Optimum Paths Problems (Q3569937) (← links)
- (Q3570242) (← links)
- Heuristic solutions for general concave minimum cost network flow problems (Q3593371) (← links)
- An improved genetic algorithm for the flowshop scheduling problem (Q3596697) (← links)
- (Q3598874) (← links)
- A defensive maximal covering problem on a network (Q3601204) (← links)
- An Efficient Algorithm for Solving the Container Loading Problem (Q3611930) (← links)
- (Q3624015) (← links)
- Sistema imunológico artificial para resolver o problema da árvore geradora mínima com parâmetros fuzzy (Q3625805) (← links)
- A Sample Approximation Approach for Optimization with Probabilistic Constraints (Q3629512) (← links)
- Octane: A New Heuristic for Pure 0–1 Programs (Q3634996) (← links)
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390) (← links)
- (Q3641861) (← links)
- (Q4224929) (← links)
- (Q4247448) (← links)
- A tabu search heuristic for the Steiner Tree Problem (Q4267398) (← links)
- A delaunay triangulation‐based heuristic for the euclidean steiner problem (Q4303626) (← links)
- (Q4350063) (← links)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (Q4363673) (← links)
- Feature Article—Genetic Algorithms for the Operations Researcher (Q4366461) (← links)
- Efficient path and vertex exchange in steiner tree algorithms (Q4367276) (← links)
- (Q4377048) (← links)
- A perturbation heuristic for a class of location problems (Q4383675) (← links)
