A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (original) (raw)

Cutting planes in integer and mixed integer programming

Alexander Martin

Discrete Applied Mathematics, 2002

View PDFchevron_right

General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

Alexander Martin

Lecture Notes in Computer Science

View PDFchevron_right

Modern branch-and-cut solvers for Mixed-Integer Linear Programming: a computational comparison

Alessandro Beltramin

2015

View PDFchevron_right

Local cuts for mixed-integer programming

Daniel Espinoza

Mathematical Programming Computation, 2013

View PDFchevron_right

Computational advances in solving Mixed Integer Linear Programming problems

Ignacio Grossmann

2018

View PDFchevron_right

Penalty Cuts for GUB-Constrained Mixed Integer Programs

Fred Glover

View PDFchevron_right

An optimality cut for mixed integer linear programs

Frédéric Semet

European Journal of Operational Research, 1999

View PDFchevron_right

Explicit-Constraint Branching for Solving Mixed-Integer Programs

Jeff Appleget

Operations Research/Computer Science Interfaces Series, 2000

View PDFchevron_right

Mixed integer non-linear programming using cutting plane techniques

Tapio Westerlund

Computer Aided Chemical Engineering, 2000

View PDFchevron_right

Foundation-penalty cuts for mixed-integer programs

Fred Glover

Operations Research Letters, 2003

View PDFchevron_right

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

George Nemhauser

INFORMS Journal on Computing, 2000

View PDFchevron_right

A recursive procedure to generate all cuts for 0���1 mixed integer programs

George Nemhauser

1990

View PDFchevron_right

AN ALGORITHM FOR SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS

Editor IJRET

View PDFchevron_right

A cutting plane method for solving linear generalized disjunctive programming problems

Ignacio Grossmann

Computers & Chemical Engineering, 2005

View PDFchevron_right

Generation of a reduced first-level mixed integer programming problem

Godfrey Chagwiza

View PDFchevron_right

Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs

Simge Kucukyavuz

Operations Research, 2011

View PDFchevron_right

Cutting planes for branch‐and‐price algorithms

Jacques Desrosiers

2011

View PDFchevron_right

Faster integer-feasibility in mixed-integer linear programs by branching to force change

J. Chinneck

Computers & Operations Research, 2011

View PDFchevron_right

Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs

Cole Smith

Optimization Letters, 2010

View PDFchevron_right

A Note on Branch and Bound Algorithm for Integer Linear Programming

Wajiha Riaz

Current Journal of Applied Science and Technology

View PDFchevron_right

Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models

Andrew Eberhard

International Journal of Mathematical, Engineering and Management Sciences

View PDFchevron_right

Conjunctive Cuts for Integer Programs

Alexander Martin

View PDFchevron_right

Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming

Vladimir Shylo

2015

View PDFchevron_right

An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming

arsalan rahmani

International Journal of Production Management and Engineering, 2017

View PDFchevron_right

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs

Yogesh Awate

Mathematical Programming, 2014

View PDFchevron_right

Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends

xiaomeng chen

arXiv (Cornell University), 2021

View PDFchevron_right

Solving Hard Mixed Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study

Alkis Vazacopoulos

View PDFchevron_right

Projected Chvátal-Gomory cuts for mixed integer linear programs

Pierre Bonami

Mathematical Programming, 2008

View PDFchevron_right

A method to improve integer linear programming problem with branch-and-bound procedure

Cooper Ku

Applied Mathematics and Computation, 2006

View PDFchevron_right