Works matching IS 00255610 AND DT 2020 AND VI 183 AND IP 1/2
Results: 23
Preface.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 1, doi. 10.1007/s10107-020-01545-7
- Publication type:
- Article
Extended formulations from communication protocols in output-efficient time.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 41, doi. 10.1007/s10107-020-01535-9
- By:
- Publication type:
- Article
Approximate multi-matroid intersection via iterative refinement.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 397, doi. 10.1007/s10107-020-01524-y
- By:
- Publication type:
- Article
A generic exact solver for vehicle routing and related problems.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 483, doi. 10.1007/s10107-020-01523-z
- By:
- Publication type:
- Article
Random projections for quadratic programs.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 619, doi. 10.1007/s10107-020-01517-x
- By:
- Publication type:
- Article
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 283, doi. 10.1007/s10107-020-01512-2
- By:
- Publication type:
- Article
Breaking symmetries to rescue sum of squares in the case of makespan scheduling.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 583, doi. 10.1007/s10107-020-01511-3
- By:
- Publication type:
- Article
Improving the integrality gap for multiway cut.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 171, doi. 10.1007/s10107-020-01485-2
- By:
- Publication type:
- Article
Dynamic flows with adaptive route choice.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 309, doi. 10.1007/s10107-020-01504-2
- By:
- Publication type:
- Article
An efficient characterization of submodular spanning tree games.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 359, doi. 10.1007/s10107-020-01499-w
- By:
- Publication type:
- Article
A new contraction technique with applications to congruency-constrained cuts.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 455, doi. 10.1007/s10107-020-01498-x
- By:
- Publication type:
- Article
Symmetry-breaking inequalities for ILP with structured sub-symmetry.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 61, doi. 10.1007/s10107-020-01491-4
- By:
- Publication type:
- Article
An exact algorithm for robust influence maximization.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 419, doi. 10.1007/s10107-020-01507-z
- By:
- Publication type:
- Article
Outer-product-free sets for polynomial optimization and oracle-based cuts.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 105, doi. 10.1007/s10107-020-01484-3
- By:
- Publication type:
- Article
Computing the nucleolus of weighted cooperative matching games in polynomial time.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 555, doi. 10.1007/s10107-020-01483-4
- By:
- Publication type:
- Article
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 249, doi. 10.1007/s10107-020-01482-5
- By:
- Publication type:
- Article
Strong mixed-integer programming formulations for trained neural networks.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 3, doi. 10.1007/s10107-020-01474-5
- By:
- Publication type:
- Article
ℓ1-Sparsity approximation bounds for packing integer programs.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 195, doi. 10.1007/s10107-020-01472-7
- By:
- Publication type:
- Article
A general framework for handling commitment in online throughput maximization.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 215, doi. 10.1007/s10107-020-01469-2
- By:
- Publication type:
- Article
On compact representations of Voronoi cells of lattices.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 337, doi. 10.1007/s10107-019-01463-3
- By:
- Publication type:
- Article
Online submodular maximization: beating 1/2 made simple.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 149, doi. 10.1007/s10107-019-01459-z
- By:
- Publication type:
- Article
The asymmetric traveling salesman path LP has constant integrality ratio.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 379, doi. 10.1007/s10107-019-01450-8
- By:
- Publication type:
- Article
Linear programming using limited-precision oracles.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 525, doi. 10.1007/s10107-019-01444-6
- By:
- Publication type:
- Article