| Publication | Date of Publication | Type |
|---|
Design of survivable networks with low connectivity requirements
International Transactions in Operational Research | 2025-01-08 | Paper |
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
Journal of Combinatorial Optimization | 2024-05-02 | Paper |
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems
Operations Research | 2024-03-12 | Paper |
On the minimum \(s-t\) cut problem with budget constraints
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
The multiple Steiner TSP with order constraints: complexity and optimization algorithms
Soft Computing | 2022-07-21 | Paper |
On the linear relaxation of the \(s-t\)-cut problem with budget constraints
| 2021-02-04 | Paper |
The multi-terminal vertex separator problem: branch-and-cut-and-price
Discrete Applied Mathematics | 2021-01-13 | Paper |
Randomized contractions for multiobjective minimum cuts
| 2020-05-27 | Paper |
Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Discrete Optimization | 2020-02-24 | Paper |
On the star forest polytope for trees and cycles
RAIRO - Operations Research | 2020-02-07 | Paper |
Distance transformation for network design problems
SIAM Journal on Optimization | 2019-08-27 | Paper |
The vertex \(k\)-cut problem
Discrete Optimization | 2019-06-13 | Paper |
The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
Discrete Applied Mathematics | 2019-02-21 | Paper |
Branch-and-cut-and-price algorithms for the preemptive RCPSP
RAIRO - Operations Research | 2018-11-01 | Paper |
Optimization algorithms for the disjunctively constrained knapsack problem
Soft Computing | 2018-10-22 | Paper |
Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
Networks | 2018-05-23 | Paper |
Two node-disjoint hop-constrained survivable network design and polyhedra
Networks | 2018-05-23 | Paper |
A bilevel programming model for proactive countermeasure selection in complex ICT systems
| 2018-04-11 | Paper |
A hybrid optimization approach for the Steiner \(k\)-connected network design problem
| 2018-04-11 | Paper |
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
| 2018-04-11 | Paper |
Minimal arc-sets spanning dicycles
Discrete Applied Mathematics | 2018-04-04 | Paper |
Survivability in hierarchical telecommunications networks under dual homing
INFORMS Journal on Computing | 2017-03-01 | Paper |
Unsplittable non-additive capacitated network design using set functions polyhedra
Computers \& Operations Research | 2016-11-17 | Paper |
The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut
| 2016-10-18 | Paper |
Composition of graphs and the triangle free subgraph polytope
| 2016-07-01 | Paper |
On Steiner 2-edge connected polytopes
| 2016-07-01 | Paper |
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
On the complexity of the Eulerian closed walk with precedence path constraints problem
| 2013-11-08 | Paper |
Structural analysis for differential-algebraic systems: complexity, formulation and facets
| 2013-11-08 | Paper |
Hop-level flow formulation for the survivable network design with hop constraints problem
Networks | 2013-08-06 | Paper |
Polyhedral analysis and branch-and-cut for the structural analysis problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
On the complexity of the Eulerian closed walk with precedence path constraints problem
Theoretical Computer Science | 2012-08-08 | Paper |
The \(k\) edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization | 2012-06-20 | Paper |
Solving VLSI design and DNA sequencing problems using bipartization of graphs
Computational Optimization and Applications | 2012-06-19 | Paper |
Survivability in hierarchical telecommunications networks
Networks | 2012-06-18 | Paper |
Models for the single-vehicle preemptive pickup and delivery problem
Journal of Combinatorial Optimization | 2012-05-23 | Paper |
On the NP-completeness of the perfect matching free subgraph problem
Theoretical Computer Science | 2012-05-14 | Paper |
Partition inequalities: separation, extensions, and network design
| 2012-01-26 | Paper |
Polyhedral approaches
| 2011-03-09 | Paper |
The maximum cut problem
| 2010-12-08 | Paper |
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Generating facets for the independence system polytope
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
On the Polytope of the (1,2)-Survivable Network Design Problem
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
The Maximum Induced Bipartite Subgraph Problem with Edge Weights
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
On the dominating set polytope
European Journal of Combinatorics | 2008-04-22 | Paper |
On the \(k\) edge-disjoint 2-hop-constrained paths polytope
Operations Research Letters | 2008-03-28 | Paper |
Integer programming formulations for the two 4-hop-constrained paths problem
Networks | 2007-03-30 | Paper |
Design of survivable IP-over-optical networks
Annals of Operations Research | 2007-02-05 | Paper |
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Networks | 2007-02-02 | Paper |
Polyhedral results for the bipartite induced subgraph problem
Discrete Applied Mathematics | 2006-10-30 | Paper |
On the independent dominating set polytope
European Journal of Combinatorics | 2006-04-28 | Paper |
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Critical extreme points of the 2-edge connected spanning subgraph polytope
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Design of Survivable Networks: A survey
Networks | 2005-09-22 | Paper |
scientific article; zbMATH DE number 2196281 (Why is no real title available?)
| 2005-08-22 | Paper |
On survivable network polyhedra
Discrete Mathematics | 2005-04-18 | Paper |
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
Linear Algebra and its Applications | 2004-05-27 | Paper |
Composition of graphs and the triangle-free subgraph polytope
Journal of Combinatorial Optimization | 2003-06-09 | Paper |
Separation of partition inequalities for the \((1,2)\)-survivable network design problem
Operations Research Letters | 2003-04-03 | Paper |
The Steiner Traveling Salesman Polytope and Related Polyhedra
SIAM Journal on Optimization | 2003-01-05 | Paper |
Steiner trees and polyhedra
Discrete Applied Mathematics | 2002-07-30 | Paper |
Separation of partition inequalities
Mathematics of Operations Research | 2001-11-26 | Paper |
On the linear relaxation of the 2-node connected subgraph polytope
Discrete Applied Mathematics | 1999-09-22 | Paper |
scientific article; zbMATH DE number 1342128 (Why is no real title available?)
| 1999-09-22 | Paper |
On perfectly two-edge connected graphs
Discrete Mathematics | 1998-02-24 | Paper |
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
One-node cutsets and the dominating set polytope
Discrete Mathematics | 1997-06-10 | Paper |
On two-connected subgraph polytopes
Discrete Mathematics | 1996-03-24 | Paper |
A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
Discrete Applied Mathematics | 1995-10-17 | Paper |
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
SIAM Journal on Discrete Mathematics | 1994-12-01 | Paper |
Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
SIAM Journal on Discrete Mathematics | 1994-12-01 | Paper |
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
SIAM Journal on Discrete Mathematics | 1994-12-01 | Paper |
Compositions of Graphs and Polyhedra II: Stable Sets
SIAM Journal on Discrete Mathematics | 1994-10-24 | Paper |
Two-edge connected spanning subgraphs and polyhedra
Mathematical Programming. Series A. Series B | 1994-08-10 | Paper |
Compositions in the bipartite subgraph polytope
Discrete Mathematics | 1993-01-16 | Paper |
On a composition of independence systems by circuit identification
Journal of Combinatorial Theory. Series B | 1992-06-28 | Paper |
scientific article; zbMATH DE number 30950 (Why is no real title available?)
| 1992-06-28 | Paper |
A note onKi-perfect graphs
Journal of Graph Theory | 1990-01-01 | Paper |
Facets of the balanced (acyclic) induced subgraph polytope
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On the stable set polytope of a series-parallel graph
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Ki-covers. II.Ki-perfect graphs
Journal of Graph Theory | 1987-01-01 | Paper |
On the cut polytope
Mathematical Programming | 1986-01-01 | Paper |
\(K_ i\)-covers. I: Complexity and polytopes
Discrete Mathematics | 1986-01-01 | Paper |
Facets of the Bipartite Subgraph Polytope
Mathematics of Operations Research | 1985-01-01 | Paper |
Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
