Generation techniques for linear programming instances with controllable properties
From MaRDI portal
Publication:2220897
DOI10.1007/s12532-019-00170-6zbMath1452.90214OpenAlexW2967970724MaRDI QIDQ2220897
Simon Bowly, Davaatseren Baatar, Kate A. Smith-Miles, Hans D. Mittelmann
Publication date: 25 January 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-019-00170-6
Analysis of algorithms (68W40) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (3)
Enhanced instance space analysis for the maximum flow problem ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ The international timetabling competition on sports timetabling (ITC2021)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- ASlib: a benchmark library for algorithm selection
- Generating new test instances by evolving in instance space
- Algorithm runtime prediction: methods \& evaluation
- A statistical analysis of an algorithm's complexity
- Measuring instance difficulty for combinatorial optimization problems
- A mixed evolutionary-statistical analysis of an algorithm's complexity
- Testing heuristics: We have it all wrong
- A brief history of linear and mixed-integer programming computation
- The Generation of Experimental Data for Computational Testing in Optimization
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
- Empirical hardness models
- ParamILS: An Automatic Algorithm Configuration Framework
- Probabilistic Models for Linear Programming
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Needed: An Empirical Science of Algorithms
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Generation techniques for linear programming instances with controllable properties