The following pages link to Rico Zenklusen (Q299792):
Displaying 50 items.
- Approximate dynamic programming for stochastic linear control problems on compact state spaces (Q299794) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- A note on chromatic properties of threshold graphs (Q418900) (← links)
- A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
- An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
- Stochastic convergence of random search methods to fixed size Pareto front approximations (Q545118) (← links)
- Matching interdiction (Q602686) (← links)
- A flow model based on polylinking system (Q715085) (← links)
- (Q977763) (redirect page) (← links)
- Computational complexity of impact size estimation for spreading processes on networks (Q977764) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- A tight bound on the collection of edges in MSTs of induced subgraphs (Q1003845) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Congestion games viewed from M-convexity (Q1785371) (← links)
- \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Submodular minimization under congruency constraints (Q2300162) (← links)
- An adaptive routing approach for personal rapid transit (Q2392823) (← links)
- Extension complexities of Cartesian products involving a pyramid (Q2404613) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- High-confidence estimation of small <i>s</i> -<i>t</i> reliabilities in directed acyclic networks (Q3087625) (← links)
- Approximation Algorithms for Conflict-Free Vehicle Routing (Q3092267) (← links)
- Max-sum diversity via convex programming (Q3132860) (← links)
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
- k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
- Approximation Schemes for Multi-Budgeted Independence Systems (Q3586491) (← links)
- Online Contention Resolution Schemes (Q4575652) (← links)
- Local Search for Max-Sum Diversification (Q4575743) (← links)
- Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations (Q4575902) (← links)
- Firefighting on Trees Beyond Integrality Gaps (Q4575905) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- (Q4607930) (← links)
- Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting (Q4607933) (← links)
- Firefighting on Trees Beyond Integrality Gaps (Q4629988) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Hardness and approximation for network flow interdiction (Q4638580) (← links)
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case (Q4910821) (← links)
- Chain-Constrained Spanning Trees (Q4910827) (← links)
- A strongly polynomial algorithm for bimodular integer linear programming (Q4978060) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
