Perfect matching interdiction problem restricted to a stable vertex
type: Item
instance of: scholarly article
title: Perfect matching interdiction problem restricted to a stable vertex
zbMATH Open document ID: 1401.05243
author: Gholam Hassan Shirdel
author: N. Kahkeshani
published in: International Journal of Applied and Computational Mathematics
publication date: 2018-10-15T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6954800
zbMATH Keywords: perfect matching
zbMATH Keywords: interdiction
zbMATH Keywords: stable vertex
zbMATH Keywords: weighted graph
MaRDI profile type: Publication
full work available at URL: s40819-018-0553-3
OpenAlex ID: W2891446515
cites work: The multi-terminal maximum-flow network-interdiction problem
cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
cites work: Multi-level programming and conflict resolution
cites work: Most vital links and nodes in weighted networks
cites work: Shortest-path network interdiction
cites work: Nodal interdiction
cites work: Optimal interdiction of a supply network
cites work: Finding the n Most Vital Links in Flow Networks
cites work: Deterministic network interdiction
cites work: Matching interdiction
cites work: Network flow interdiction on planar graphs
Wikidata QID: Q129250125
DOI: 10.1007/S40819-018-0553-3
Recommended article: Q3074446
Recommended article: A generalization of the stable matching problem
Recommended article: Stable Matchings, Optimal Assignments, and Linear Programming
Recommended article: Stable matchings and linear programming
Recommended article: A further note on the stable matching problem
Recommended article: Perfect matchings with restricted intersection in cubic graphs
Recommended article: Stable matchings with covering constraints: a complete computational trichotomy
Recommended article: Implementable stable solutions to pure matching problems
Recommended article: Q5002612
description: scientific article; zbMATH DE number 6954800