Generation techniques for linear programming instances with controllable properties
From MaRDI portal
Publication:2220897
Recommendations
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- Generating applicable synthetic instances for branch problems
- GENGUB: A generator for linear programs with generalized upper bound constraints
- Generating new test instances by evolving in instance space
- Parameter controlled instance generation for lot sizing problems
Cites work
- A brief history of linear and mixed-integer programming computation
- A mixed evolutionary-statistical analysis of an algorithm's complexity
- A statistical analysis of an algorithm's complexity
- Algorithm runtime prediction: methods \& evaluation
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- ASlib: a benchmark library for algorithm selection
- Empirical hardness models, methodology and a case study on combinatorial auctions
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- Generating new test instances by evolving in instance space
- scientific article; zbMATH DE number 91756 (Why is no real title available?)
- scientific article; zbMATH DE number 956856 (Why is no real title available?)
- Measuring instance difficulty for combinatorial optimization problems
- Needed: An Empirical Science of Algorithms
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Paramils: an automatic algorithm configuration framework
- Probabilistic Models for Linear Programming
- Testing heuristics: We have it all wrong
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- The generation of experimental data for computational testing in optimization
Cited in
(7)- 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)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- Which algorithm to select in sports timetabling?
- Machine scheduling instance generation by reverse engineering from instance space analysis
This page was built for publication: Generation techniques for linear programming instances with controllable properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220897)
