Minimum cost flow problem with conflicts
From MaRDI portal
Publication:6065835
DOI10.1002/net.22021OpenAlexW3126580133MaRDI QIDQ6065835
No author found.
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
combinatorial optimizationbranch-and-boundnetworksminimum cost flowRussian doll searchconflict constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- The minimum cost perfect matching problem with conflict pair constraints
- The maximum flow problem with disjunctive constraints
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On risk-averse maximum weighted subgraph problems
- The minimum spanning tree problem with conflict constraints and its variations
- Paths, trees and matchings under disjunctive constraints
- Approximation algorithms for time constrained scheduling
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- Exact algorithms for procurement problems under a total quantity discount structure
- The transportation problem with exclusionary side constraints
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- Efficient graph representations
- A generalized classification scheme for crane scheduling with interference
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
- The directed profitable rural postman problem with incompatibility constraints
- Heuristics and lower bounds for the bin packing problem with conflicts
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Solving transportation problems with nonlinear side constraints with tabu search
- An approximation scheme for bin packing with conflicts
- 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
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Incidence matrices and interval graphs
- Minimum cost noncrossing flow problem on layered networks
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- Minimum-cost flow algorithms: an experimental evaluation
- The Knapsack Problem with Conflict Graphs
- Integer Programming
- Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Transportation problem with nonlinear side constraints a branch and bound approach
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A New Algorithm for Generating All the Maximal Independent Sets
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Combinatorial bounds via measure and conquer
- Algorithm Theory - SWAT 2004
- On cliques in graphs
This page was built for publication: Minimum cost flow problem with conflicts