Assignment problem with conflicts

DOI10.1016/J.COR.2019.07.001MaRDI QIDQ2273673zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 25 September 2019

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

Full work available at URL https://doi.org/10.1016/j.cor.2019.07.001

zbMATH Keywords

assignment problembranch-and-boundconflictsinteger programming

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The minimum cost perfect matching problem with conflict pair constraints
• Algorithms for the bin packing problem with conflicts
• The transportation problem with conflicts
• Two kinds of constrained assignment problems
• A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints

Cites work

• A branch and cut algorithm for minimum spanning trees under conflict constraints
• A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A constrained matching problem
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• Determining a Minimum Spanning Tree with Disjunctive Constraints
• scientific article; zbMATH DE number 4181140 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Matching problems with generalized upper bound side constraints
• Minimum cost noncrossing flow problem on layered networks
• Network flows. Theory, algorithms, and applications.
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• Paths, trees and matchings under disjunctive constraints
• Some Facets for an Assignment Problem with Side Constraints
• Some Matching Problems for Bipartite Graphs
• The complexity of matching with bonds
• The Knapsack Problem with Conflict Graphs
• The maximum flow problem with disjunctive constraints
• The minimum cost perfect matching problem with conflict pair constraints
• The minimum spanning tree problem with conflict constraints and its variations
• The NP-completeness of the bandwidth minimization problem
• The transportation problem with exclusionary side constraints
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• The traveling salesman problem. A computational study.

Cited in

(10)

• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Set covering problem with conflict constraints
• A matheuristic for a customer assignment problem in direct marketing
• The minimum cost perfect matching problem with conflict pair constraints
• A three-phase matheuristic algorithm for the multi-day task assignment problem
• Minimum cost flow problem with conflicts
• Maximum weight perfect matching problem with additional disjunctive conflict constraints
• An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
• Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
• Repulsive assignment problem

This page was built for publication: Assignment problem with conflicts

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