Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

A linear time algorithm for linearizing quadratic and higher-order shortest path problems: Label: en
Multiplicative auction algorithm for approximate maximum weight bipartite matching: Label: en
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints: Label: en
Constant-competitiveness for random assignment matroid secretary without knowing the matroid: Label: en
Cut-sufficient directed 2-commodity multiflow topologies: Label: en
Advances on strictly \(\varDelta \)-modular IPs: Label: en
Towards an optimal contention resolution scheme for matchings: Label: en
Exploiting the polyhedral geometry of stochastic linear bilevel programming: Label: en
Compressing branch-and-bound trees: Label: en
Towards a characterization of maximal quadratic-free sets: Label: en
Set selection under explorable stochastic uncertainty via covering techniques: Label: en
Decomposition of probability marginals for security games in abstract networks: Label: en
Optimal general factor problem and jump system intersection: Label: en
Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts: Label: en
A deterministic better-than-3/2 approximation algorithm for metric TSP: Label: en
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling: Label: en
The polyhedral geometry of truthful auctions: Label: en
A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP: Label: en
On the correlation gap of matroids: Label: en
ReLU neural networks of polynomial size for exact maximum flow computation: Label: en
Designing optimization problems with diverse solutions: Label: en
Stabilization of capacitated matching games: Label: en
An update-and-stabilize framework for the minimum-norm-point problem: Label: en
Configuration balancing for stochastic requests: Label: en
Optimizing low dimensional functions over the integers: Label: en
From approximate to exact integer programming: Label: en
Monoidal strengthening and unique lifting in MIQCPs: Label: en
Inapproximability of shortest paths on perfect matching polytopes: Label: en
Recycling inequalities for robust combinatorial optimization with budget uncertainty: Label: en
Sparse approximation over the cube: Label: en
A nearly optimal randomized algorithm for explorable heap selection: Label: en
Efficient separation of RLT cuts for implicit and explicit bilinear products: Label: en
Information complexity of mixed-integer convex optimization: Label: en
Transitive packing: Label: en
The strongest facets of the acyclic subgraph polytope are unknown: Label: en
Optimal on-line algorithms for single-machine scheduling: Label: en
A new approach to computing optimal schedules for the job-shop scheduling problem: Label: en
Minimizing total completion time in a two-machine flowshop: Analysis of special cases: Label: en
Improved randomized approximation algorithms for lot-sizing problems: Label: en
Coloring bipartite hypergraphs: Label: en
The travelling salesman and the PQ-tree: Label: en
Separating maximally violated comb inequalities in planar graphs: Label: en
Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time: Label: en
A polyhedral approach to the feedback vertex set problem: Label: en
An Integer Programming Approach for Linear Programs with Probabilistic Constraints: Label: en
Sign-Solvable Linear Complementarity Problems: Label: en
Characterizations of Total Dual Integrality: Label: en
Simple Explicit Formula for Counting Lattice Points of Polyhedra: Label: en
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows: Label: en
On the MIR Closure of Polyhedra: Label: en