Cited in
(only showing first 100 items - show all)- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- Preprocessing rules for integer programming solutions to the generalised assignment problem
- Cutting optimization with variable-sized stock and inventory status data
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
- Heuristic and exact algorithms for scheduling aircraft landings
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A novel hybrid algorithm for minimizing total weighted tardiness cost
- Fast bounding procedures for large instances of the simple plant location problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Multiple allocation tree of hubs location problem for non-complete networks
- Efficient algorithms for real-life instances of the variable size bin packing problem
- A linear risk-return model for enhanced indexation in portfolio optimization
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- Non-convex nested Benders decomposition
- A simulated annealing code for general integer linear programs
- A new formulation and resolution method for the \(p\)-center problem
- A note on equity across groups in facility location
- Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
- A sparse enhanced indexation model with chance and cardinality constraints
- Bridging \(k\)-sum and CVaR optimization in MILP
- GRASP and VNS for solving the \(p\)-next center problem
- Exact solution techniques for two-dimensional cutting and packing
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Metaheuristic applications on discrete facility location problems: a survey
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- A cutting plane method for knapsack polytope
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- scientific article; zbMATH DE number 1424553 (Why is no real title available?)
- A perturbation heuristic for a class of location problems
- Solving the quadratic assignment problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- On the separation of disjunctive cuts
- An Efficient Algorithm for Solving the Container Loading Problem
- A parallel genetic algorithm to solve the set-covering problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- scientific article; zbMATH DE number 1114464 (Why is no real title available?)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Measuring the Performance of Parallel Metaheuristics
- scientific article; zbMATH DE number 1383814 (Why is no real title available?)
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- Using extra dual cuts to accelerate column generation
- Constraint handling in genetic algorithms: the set partitioning problem
- 2DPackLib
- An inexact bundle approach to cutting-stock problems
- Efficient projected gradient methods for cardinality constrained optimization
- The incremental cooperative design of preventive healthcare networks
- A heuristic algorithm for resource allocation/reallocation problem
- Optimizing facility location and design
- Exact and heuristic approaches for the set cover with pairs problem
- Parallel local search for Steiner trees in graphs
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- An improved algorithm for computing Steiner minimal trees in Euclidean d-space
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Sistema imunológico artificial para resolver o problema da árvore geradora mínima com parâmetros fuzzy
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- On embedding the volume algorithm in a variable target value method.
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Solution of problems of minimal set partition and set covering
- An improved constraint satisfaction adaptive neural network for job-shop scheduling
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- A novel decomposition approach to set covering problems by exploiting special structures
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Hub location-allocation in intermodal logistic networks
- A genetic algorithm for the aircraft landing problem with predetermined time window and earliness/tardiness penalties
- scientific article; zbMATH DE number 1163723 (Why is no real title available?)
- scientific article; zbMATH DE number 1488088 (Why is no real title available?)
- Add/drop procedures for the capacitated plant location problem
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- Problem difficulty for tabu search in job-shop scheduling
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- scientific article; zbMATH DE number 1946631 (Why is no real title available?)
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- Generating applicable synthetic instances for branch problems
- Integer optimization by local search. A domain-independent approach
- A simple tabu search for warehouse location
- A computational study for the \(p\)-median problem
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- Solving the uncapacitated hub location problem using genetic algorithms
- scientific article; zbMATH DE number 1738678 (Why is no real title available?)
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
- Exactly solving a two-level location problem with modular node capacities
- A heuristic algorithm for the set covering problem
- New exact algorithms for one-machine earliness-tardiness scheduling
- Time-indexed formulations and the total weighted tardiness problem
- Quotient geometric crossovers and redundant encodings
- Genetic algorithms for job shop scheduling problems with alternative routings
- Parallel algorithms for a multi-level network optimization problem
- 2DPackLib: a two-dimensional cutting and packing library
- On the exact separation of cover inequalities of maximum-depth
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
This page was built for software: OR-Library
