The following pages link to OR-Library (Q16337):
Displaying 50 items.
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
- A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- Iterated local search for consecutive block minimization (Q2668701) (← links)
- The aircraft runway scheduling problem: a survey (Q2668767) (← links)
- Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Penalty and partitioning techniques to improve performance of QUBO solvers (Q2673235) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
- Product line optimization with multiples sites (Q2676378) (← links)
- Add/drop procedures for the capacitated plant location problem (Q2741478) (← links)
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806) (← links)
- (Q2753742) (← links)
- Heuristic and exact algorithms for scheduling aircraft landings (Q2767230) (← links)
- (Q2771641) (← links)
- Reactive tabu search with path-relinking for the Steiner problem in graphs (Q2776545) (← links)
- Strategies for the parallel implementation of metaheuristics (Q2776561) (← links)
- (Q2780181) (← links)
- An exact method for the vehicle routing problem with backhauls (Q2783863) (← links)
- Exact solution of the two-dimensional finite bin packing problem (Q2783932) (← links)
- Robustness to dependency in portfolio optimization using overlapping marginals (Q2797466) (← links)
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
- A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
- Solution of problems of minimal set partition and set covering (Q2813442) (← links)
- Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem (Q2814141) (← links)
- CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Generating applicable synthetic instances for branch problems (Q2846416) (← links)
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
- Bat Algorithm and Cuckoo Search: A Tutorial (Q2866120) (← links)
- A computational study for the \(p\)-median problem (Q2883594) (← links)
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem (Q2884524) (← links)
- A hybrid GRASP with perturbations for the Steiner problem in graphs (Q2884534) (← links)
- A new formulation and resolution method for the \(p\)-center problem (Q2890410) (← links)
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459) (← links)
- Using extra dual cuts to accelerate column generation (Q2890465) (← links)
- A note on equity across groups in facility location (Q2892131) (← links)
- Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
- A set-covering-based heuristic approach for bin-packing problems (Q2892273) (← links)
- Early estimates of the size of branch-and-bound trees (Q2892274) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- Time-indexed formulations and the total weighted tardiness problem (Q2900999) (← links)
- New exact algorithms for one-machine earliness-tardiness scheduling (Q2901056) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application (Q2954352) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
