Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
type: Item
instance of: scholarly article
title: Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
zbMATH Open document ID: 1387.90150
author: Agostinho Agra
author: Mahdi Doostmohammadi
author: Cid Carvalho de Souza
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6872088
zbMATH Keywords: mixed integer programming
zbMATH Keywords: valid inequality
zbMATH Keywords: separation
zbMATH Keywords: vertex packing set
zbMATH Keywords: conflict graph
zbMATH Keywords: independent set
Wikidata QID: Q57736482
describes a project that uses: PORTA
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.05.005
OpenAlex ID: W2473765182
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Production Planning by Mixed Integer Programming
cites work: Conflict graphs in solving integer programming problems
cites work: Conflict analysis in mixed integer programming
cites work: Facets of the independent set polytope
cites work: Generating Facets for the Independence System Polytope
cites work: Properties of vertex packing and independence system polyhedra
cites work: On the facial structure of set packing polyhedra
cites work: The mixed vertex packing problem.
cites work: The Flow Set with Partial Order
cites work: A maritime inventory routing problem: discrete time formulations and valid inequalities
cites work: Hybrid heuristics for a short sea inventory routing problem
cites work: A generalization of antiwebs to independence systems and their canonical facets
cites work: Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
cites work: An extended formulation approach to the edge-weighted maximal clique problem
cites work: A sequential elimination algorithm for computing bounds on the clique number of a graph
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
DOI: 10.1016/J.DISOPT.2016.05.005
description: scientific article; zbMATH DE number 6872088