Local search inequalities

DOI10.1016/J.DISOPT.2015.02.003zbMATH Open1387.90140OpenAlexW2089056015MaRDI QIDQ1751111FDOQ1751111

Authors: Giuseppe Lancia, Franca Rinaldi, Paolo Serafini 

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

Recommendations

• Partial cover and complete cover inequalities
• Local Search and Constraint Programming
• New valid inequalities and facets for the simple plant location problem
• New inequalities for the general routing problem
• Cutting planes in integer and mixed integer programming

zbMATH Keywords

local searchinteger linear programmingbranch and cut

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms
• Smoothed Performance Guarantees for Local Search
• Bounds-Consistent Local Search
• Local search in problems with nonconvex constraints
• Efficiency of Local Search
• The communication complexity of local search
• Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• Commonalities in local search
• Simple Local Search Problems that are Hard to Solve

Uses Software

• TSPLIB
• Biq Mac

This page was built for publication: Local search inequalities

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