Exact solution algorithms for the maximum flow problem with additional conflict constraints
type: Item
instance of: scholarly article
title: Exact solution algorithms for the maximum flow problem with additional conflict constraints
zbMATH Open document ID: 1487.90629
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7342742
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: maximum flow
zbMATH Keywords: conflict
zbMATH Keywords: branch-and-bound
zbMATH Keywords: Benders decomposition
zbMATH Keywords: Russian doll search
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.04.001
OpenAlex ID: W3015781022
cites work: Q3056948
cites work: Minimum cost noncrossing flow problem on layered networks
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
cites work: Decomposition algorithms for solving the minimum weight maximal matching problem
cites work: Transportation problem with nonlinear side constraints a branch and bound approach
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Integer Programming
cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
cites work: Determining a Minimum Spanning Tree with Disjunctive Constraints
cites work: Paths, trees and matchings under disjunctive constraints
cites work: Benchmarking optimization software with performance profiles.
cites work: A branch-and-price algorithm for the bin packing problem with conflicts
cites work: Algorithms for the bin packing problem with conflicts
cites work: Incidence matrices and interval graphs
cites work: A new approach to the maximum-flow problem
cites work: The transportation problem with exclusionary side constraints
cites work: Geometric algorithms and combinatorial optimization.
cites work: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
cites work: Approximation algorithms for time constrained scheduling
cites work: Minimum-cost flow algorithms: an experimental evaluation
cites work: Tailoring Benders decomposition for uncapacitated network design
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Algorithm Theory - SWAT 2004
cites work: Thick non-crossing paths and minimum-cost flows in polygonal domains
cites work: The minimum cost perfect matching problem with conflict pair constraints
cites work: Russian doll search for the Steiner triple covering problem
cites work: The Knapsack Problem with Conflict Graphs
cites work: The maximum flow problem with disjunctive constraints
cites work: The Benders decomposition algorithm: a literature review
cites work: Cross decomposition for mixed integer programming
cites work: On risk-averse maximum weighted subgraph problems
cites work: A branch and cut algorithm for minimum spanning trees under conflict constraints
cites work: On the history of the transportation and maximum flow problems
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Efficient graph representations
cites work: The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
cites work: Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
cites work: The minimum spanning tree problem with conflict constraints and its variations
DOI: 10.1016/J.EJOR.2020.04.001
description: scientific article; zbMATH DE number 7342742