On the Exact Separation of Mixed Integer Knapsack Cuts

DOI10.1007/978-3-540-72792-7_18MaRDI QIDQ5429270zbMATH OpenOpenAlexFDO

Authors Ricardo Fukasawa, Marcos Goycoolea

Publication date 29 November 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72792-7_18

zbMATH Keywords

cutting plane algorithmsinteger programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the exact separation of mixed integer knapsack cuts
• Cutting planes for mixed-integer knapsack polyhedra
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• MIR closures of polyhedral sets
• On the facets of the mixed-integer knapsack polyhedron

Cited in

(8)

• MIPping closures: An instant survey
• A cutting plane method for knapsack polytope
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• On the knapsack closure of 0-1 integer linear programs
• On the exact separation of mixed integer knapsack cuts
• A heuristic to generate rank-1 GMI cuts
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
• A computational study of exact knapsack separation for the generalized assignment problem

Describes a project that uses

Uses Software

• MIPLIB

This page was built for publication: On the Exact Separation of Mixed Integer Knapsack Cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429270)