Maximum weight perfect matching problem with additional disjunctive conflict constraints
From MaRDI portal
Publication:6179693
DOI10.1002/net.22139zbMath1529.90077MaRDI QIDQ6179693
No author found.
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum cost perfect matching problem with conflict pair constraints
- The maximum flow problem with disjunctive constraints
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- The minimum spanning tree problem with conflict constraints and its variations
- Paths, trees and matchings under disjunctive constraints
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- An exact algorithm for the maximum clique problem
- The transportation problem with exclusionary side constraints
- Matching theory
- An exact algorithm for the maximum stable set problem
- A multi-KP modeling for the maximum-clique problem
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Assignment problem with conflicts
- Improving upper bounds for the clique number by non-valid inequalities
- Minimum cost noncrossing flow problem on layered networks
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Finding a Maximum Clique in an Arbitrary Graph
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Reducibility among Combinatorial Problems
- On the facial structure of set packing polyhedra
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Integer Linear Programming in Computational and Systems Biology
- Benchmarking optimization software with performance profiles.
This page was built for publication: Maximum weight perfect matching problem with additional disjunctive conflict constraints