Augmentation search for integer programming over a polyhedron

DOI10.1016/J.COR.2025.107204MaRDI QIDQ6891338zbMATH OpenFDO

Authors Tolga Bektaş

Publication date 2 December 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107204

zbMATH Keywords

augmentationclusteringgraver basesinteger programmingnonlinear integer programmingquadratic assignment

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• 0/1-Integer programming: Optimization and Augmentation are equivalent
• A Geometric Buchberger Algorithm for Integer Programming
• A GRASP for the biquadratic assignment problem
• A primal (all-integer) integer programming algorithm
• A quantum-inspired bilevel optimization algorithm for the first responder network design problem
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• A Variant of the Buchberger Algorithm for Integer Programming
• Algebraic and geometric ideas in the theory of discrete optimization
• An algorithmic framework for convex mixed integer nonlinear programs
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• An improved column generation algorithm for minimum sum-of-squares clustering
• Assignment Problems
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
• Branching and bounds tighteningtechniques for non-convex MINLP
• Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
• Finding multiple solutions to general integer linear programs
• scientific article; zbMATH DE number 3219393 (Why is no real title available?)
• Improved integral simplex using decomposition for the set partitioning problem
• Integral simplex using decomposition for the set partitioning problem
• Nonlinear discrete optimization. An algorithmic theory
• On the foundations of linear and integer linear programming I
• Pivot and shift -- a mixed integer programming heuristic
• Primal cutting plane algorithms revisited
• Proximity search for 0--1 mixed-integer convex programming
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• Solving MIPs via scaling-based augmentation
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• The feasibility pump
• The integral basis method for integer programming
• The quadratic Graver cone, quadratic integer minimization, and extensions

This page was built for publication: Augmentation search for integer programming over a polyhedron

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