On the Exact Separation of Mixed Integer Knapsack Cuts

DOI10.1007/978-3-540-72792-7_18zbMath1136.90418OpenAlexW2168332770MaRDI QIDQ5429270

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

integer programmingcutting plane algorithms

Mathematics Subject Classification ID

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

Related Items (5)

A cutting plane method for knapsack polytope ⋮ A heuristic to generate rank-1 GMI cuts ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ Unnamed Item ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

Uses Software

• MIPLIB

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