Minimum cost flow problem with conflicts

DOI10.1002/NET.22021MaRDI QIDQ6065835zbMATH OpenOpenAlexFDO

Authors

Publication date 11 December 2023

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.22021

zbMATH Keywords

combinatorial optimizationnetworksbranch-and-boundminimum cost flowRussian doll searchconflict constraints

Mathematics Subject Classification ID

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

Recommendations

• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• The maximum flow problem with conflict and forcing conditions
• The transportation problem with conflicts
• Assignment problem with conflicts
• Minimum cost flows with minimum quantities

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 861332 (Why is no real title available?)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• A New Algorithm for Generating All the Maximal Independent Sets
• 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 branch-and-price algorithm for the bin packing problem with conflicts
• A generalized classification scheme for crane scheduling with interference
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
• Algorithm Theory - SWAT 2004
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• Algorithms for the bin packing problem with conflicts
• An approximation scheme for bin packing with conflicts
• Approximation algorithms for time constrained scheduling
• Assignment problem with conflicts
• Combinatorial bounds via measure and conquer
• Determining a Minimum Spanning Tree with Disjunctive Constraints
• Efficient graph representations
• Exact algorithms for procurement problems under a total quantity discount structure
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Heuristics and lower bounds for the bin packing problem with conflicts
• Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
• Incidence matrices and interval graphs
• Integer Programming
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Minimum cost noncrossing flow problem on layered networks
• Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
• Minimum-cost flow algorithms: an experimental evaluation
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flows. Theory, algorithms, and applications.
• On cliques in graphs
• On risk-averse maximum weighted subgraph problems
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• Paths, trees and matchings under disjunctive constraints
• Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
• Solving transportation problems with nonlinear side constraints with tabu search
• The Knapsack Problem with Conflict Graphs
• The directed profitable rural postman problem with incompatibility constraints
• 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 multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The transportation problem with exclusionary side constraints
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Transportation problem with nonlinear side constraints a branch and bound approach

Cited in

(4)

• Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
• An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
• Shortest paths with exclusive-disjunction arc pairs conflicts
• On the complexity of the upgrading version of the maximal covering location problem

This page was built for publication: Minimum cost flow problem with conflicts

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