Local search inequalities

DOI10.1016/j.disopt.2015.02.003zbMath1387.90140OpenAlexW2089056015MaRDI QIDQ1751111

Giuseppe Lancia, Paolo Serafini, Franca Rinaldi

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.02.003

zbMATH Keywords

local searchbranch and cutinteger linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

Uses Software

• TSPLIB
• Biq Mac

Cites Work

• Lifting and separation procedures for the cut polytope
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Theoretical aspects of local search.
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Some simplified NP-complete graph problems
• Logic cuts for processing networks with fixed charges
• Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
• An effective compact formulation of the max cut problem on sparse graphs
• On the symmetric travelling salesman problem I: Inequalities
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• Solving the Orienteering Problem through Branch-and-Cut
• On the cut polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local search inequalities