Journal ArticleDOI
OR-Library: Distributing Test Problems by Electronic Mail
Reads0
Chats0
TLDR
A system (OR-Library) that distributes test problems by electronic mail (e-mail) that has available test problems drawn from a number of different areas of operational research.Abstract:
In this note we present a system (OR-Library) that distributes test problems by electronic mail (e-mail). This system currently has available test problems drawn from a number of different areas of...read more
Citations
More filters
Journal ArticleDOI
Variable neighborhood search
Nenad Mladenović,Pierre Hansen +1 more
TL;DR: This chapter presents the basic schemes of VNS and some of its extensions, and presents five families of applications in which VNS has proven to be very successful.
Book
Metaheuristics: From Design to Implementation
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Journal ArticleDOI
Greedy Randomized Adaptive Search Procedures
TL;DR: This paper defines the various components comprising a GRASP and demonstrates, step by step, how to develop such heuristics for combinatorial optimization problems.
Journal ArticleDOI
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
References
More filters
Journal ArticleDOI
Computational experience with a primal-dual interior point method for linear programming
TL;DR: In this article, a primal-dual algorithm for linear programming is described, which allows for easy handling of simple bounds on the primal variables and incorporates free variables, which have not previously been included in a primal dual implementation.
Journal ArticleDOI
An Implementation of a Primal-Dual Interior Point Method for Linear Programming
TL;DR: Preliminary computational results indicate that this implementation compares favorably with a comparable implementation of a dual affine interior point method, and with MINOS 5.0, a state-of-the-art implementation of the simplex method.
Journal ArticleDOI
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
TL;DR: This paper describes data structures and programming techniques used in an implementation of Karmarkar's algorithm for linear programming, which relies on a direct factorization scheme, with an extensive symbolic factorization step performed in a preparatory stage of the linear programming algorithm.
Journal ArticleDOI
Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
TL;DR: The dual affine interior point method is extended to handle variables with simple upper bounds as well as free variables and a variant of the big- M artificial variable method to attain feasibility is derived.
Journal ArticleDOI
Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
TL;DR: Several new algorithms that use the dual affine direction and a recentering direction in a multidirection approach are derived and the most promising of these algorithms is based on minimizing the cost function on a sequence of two-dimensional cross sections of the feasible region.