Search results for "90B10"

Found 13 publication records. Showing 13 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 05C85, 90C35, 90B10
24	Armin Fügenschuh, Simone Göttlich, Michael Herty, Claus Kirchner, Alexander Martin 0001	Efficient reformulation and solution of a nonlinear PDE-controlled flow network model.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90B10, 65Mxx
24	Mikkel Thorup	Fully-Dynamic Min-Cut.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
24	Harold N. Gabow	On the Linfinity-norm of extreme points for crossing supermodular directed network LPs.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68W25, 68R10, 90C05, 05C40, 90B10, 05C20
24	Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta	Network Design Via Iterative Rounding Of Setpair Relaxations.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10
24	Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau	Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 90B10, 90C27, 90C57
24	Jean Fonlupt, Ali Ridha Mahjoub	Critical extreme points of the 2-edge connected spanning subgraph polytope.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90B10, 90C27, 90C57
24	Michael E. Saks, Alex Samorodnitsky, Leonid Zosin	A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C20, 90C35, 90B10
24	Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno	Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 90C27, 90C25, 90C35, 90B10
24	Anna Galluccio, Luis A. Goddyn	The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C70, 90C35, 90B10
24	Yefim Dinitz, Naveen Garg 0001, Michel X. Goemans	On the Single-Source Unsplittable Flow Problem.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90B10, 05C85, 90C35, 05C38
24	Alexander V. Karzanov	A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C27, 90B10
24	Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi	A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C27, 90B10