Testing cut generators for mixed-integer linear programming
type: Item
instance of: scholarly article
title: Testing cut generators for mixed-integer linear programming
zbMATH Open document ID: 1171.90478
published in: Mathematical Programming Computation
publication date: 2009-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 5618766
author: François Margot
describes a project that uses: CPLEX
describes a project that uses: COIN-OR
describes a project that uses: R
describes a project that uses: MIPLIB2003
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: s12532-009-0003-7
OpenAlex ID: W2011167315
cites work: MIPLIB 2003
cites work: Network Reoptimization Algorithms: A Statistically Designed Comparison
cites work: A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
cites work: Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
cites work: Exact solutions to linear programming problems
cites work: Q4120330
cites work: Q4845460
cites work: Numerically safe Gomory mixed-integer cuts
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Q4471306
cites work: Local branching
cites work: Integer Programming and Pricing
cites work: Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines
cites work: Needed: An Empirical Science of Algorithms
cites work: Testing heuristics: We have it all wrong
cites work: The final NETLIB-LP results
cites work: Cutting planes in integer and mixed integer programming
cites work: Feature Article—Toward an Experimental Method for Algorithm Simulation
cites work: Experimental analysis of algorithms
cites work: Q4788644
cites work: Q4417674
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: Safe bounds in linear and mixed-integer linear programming
cites work: Q4509286
DOI: 10.1007/S12532-009-0003-7
Recommended article: Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
Recommended article: An optimality cut for mixed integer linear programs
Recommended article: A disjunctive cutting plane procedure for general mixed-integer linear programs
Recommended article: Decomposition and dynamic cut generation in integer linear programming
Recommended article: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
Recommended article: Generating cutting planes for mixed integer programming problems in a parallel computing environment
Recommended article: Cuts for Conic Mixed-Integer Programming
Recommended article: Q3096727
Recommended article: Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Recommended article: On Generating Test Problems for Nonlinear Programming Algorithms
description: scientific article; zbMATH DE number 5618766