Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs

Computational Optimization and Applications

Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

Journal of Global Optimization

On the Separation of Maximally Violated mod-k Cuts

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Generating Cuts from Multiple-Term Disjunctions

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

Cutting Planes for Mixed 0-1 Semidefinite Programs

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Projection and Lifting in Combinatorial Optimization

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]

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

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]

Branch, Cut, and Price: Sequential and Parallel

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]

Parallel randomized heuristics for the set covering problem

Practical parallel computing

Lift-and-project for mixed 0-1 programming: recent progress

Discrete Applied Mathematics

Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics

Parallel branch and cut for capacitated vehicle routing

Parallel Computing - Special issue: Parallel computing in logistics

An augment-and-branch-and-cut framework for mixed 0-1 programming

Combinatorial optimization - Eureka, you shrink!

Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs

Journal of Global Optimization

New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments

Operations Research

Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

Operations Research

Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse

Operations Research

Constraint integer programming: a new approach to integrate CP and MIP

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

Technical and industrial issues of Advanced Planning and Scheduling (APS) systems

Computers in Industry

An exact algorithm for the 0---1 linear knapsack problem with a single continuous variable

Journal of Global Optimization

Improving cutting plane generation with 0-1 inequalities by bi-criteria separation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Branch and cut methods for network optimization

Mathematical and Computer Modelling: An International Journal

Exact MAX-2SAT solution via lift-and-project closure

Operations Research Letters

Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization

Elementary closures for integer programs

Operations Research Letters

Combining Lift-and-Project and Reduce-and-Split

INFORMS Journal on Computing

Maximum expert consensus models with linear cost function and aggregation operators

Computers and Industrial Engineering

Approximating the Split Closure

INFORMS Journal on Computing