Linked e-resources
Details
Table of Contents
Total dual dyadicness and dyadic generating sets
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
On the maximal number of columns of a-modular matrix
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
aster Connectivity in Low-rank Hypergraphs via Expander Decomposition
Improving the Cook et al. Proximity Bound Given Integral Valued Constraints
Sparse Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary Variables
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
Optimal item pricing in online combinatorial auctions
On Circuit Diameter Bounds via Circuit Imbalances
A Simple Method for Convex Optimization in the Oracle Model
On the Complexity of Separation From the Knapsack Polytope
Simple odd -cycle inequalities for binary polynomial optimization
Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
Intersecting and dense restrictions of clutters in polynomial time
LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization
Generalized Malleable Scheduling under Concave Processing Speeds
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs
Matroid-Based TSP Rounding for Half-Integral Solutions
The Two-Stripe Symmetric Circulant TSP is in P
Jin and David Williamson An Abstract Model for Branch-and-Cut
Neural networks with linear threshold activations: structure and algorithms
A PTAS for the Horizontal Rectangle Stabbing Problem
Lattice-free simplices with lattice width 2d - o(d)
Graph Coloring and Semidefinite Rank
.A Competitive Algorithm for Throughput Maximization on Identical Machines
The Limits of Local Search for Weighted k-Set Packing
The Secretary Problem with Distributions.
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
On the maximal number of columns of a-modular matrix
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
aster Connectivity in Low-rank Hypergraphs via Expander Decomposition
Improving the Cook et al. Proximity Bound Given Integral Valued Constraints
Sparse Multi-Term Disjunctive Cuts for the Epigraph of a Function of Binary Variables
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
Optimal item pricing in online combinatorial auctions
On Circuit Diameter Bounds via Circuit Imbalances
A Simple Method for Convex Optimization in the Oracle Model
On the Complexity of Separation From the Knapsack Polytope
Simple odd -cycle inequalities for binary polynomial optimization
Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
Intersecting and dense restrictions of clutters in polynomial time
LP-based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization
Generalized Malleable Scheduling under Concave Processing Speeds
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs
Matroid-Based TSP Rounding for Half-Integral Solutions
The Two-Stripe Symmetric Circulant TSP is in P
Jin and David Williamson An Abstract Model for Branch-and-Cut
Neural networks with linear threshold activations: structure and algorithms
A PTAS for the Horizontal Rectangle Stabbing Problem
Lattice-free simplices with lattice width 2d - o(d)
Graph Coloring and Semidefinite Rank
.A Competitive Algorithm for Throughput Maximization on Identical Machines
The Limits of Local Search for Weighted k-Set Packing
The Secretary Problem with Distributions.