Theoretical and computational advances for network diversion

DOI10.1002/net.21514zbMath1338.90426OpenAlexW2057862707MaRDI QIDQ2811311

R. Kevin Wood, Christopher Cullenbine, Alexandra M. Newman

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

complexityminimum cutmixed-integer programmingvalid inequalitynetwork diversion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for minimum weight odd circuits and cuts in planar graphs
• Cohesion and stability in graphs
• Strong formulations for mixed integer programming: A survey
• The directed subgraph homeomorphism problem
• Mobility, sensing, and security management in wireless ad hoc sensor systems
• Combinatorial optimization. Theory and applications.
• Interdicting a Nuclear-Weapons Project
• Improving Discrete Model Representations via Symmetry Considerations
• Maximal Flow Through a Network
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• A Polynomial Solution to the Undirected Two Paths Problem
• Tabu Search—Part I
• Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
• On super i‐connected graphs
• Finding k Disjoint Paths in a Directed Planar Graph
• The network inhibition problem

This page was built for publication: Theoretical and computational advances for network diversion