Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 449, doi. 10.1007/s10107-022-01892-7
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2023 AND VI 197 AND IP 2
Results: 27
1
2
Linear regression with partially mismatched data: local search with theoretical guarantees.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1265, doi. 10.1007/s10107-022-01863-y
- By:
- Publication type:
- Article
3
Semi-streaming algorithms for submodular matroid intersection.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 967, doi. 10.1007/s10107-022-01858-9
- By:
- Publication type:
- Article
4
A new integer programming formulation of the graphical traveling salesman problem.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 877, doi. 10.1007/s10107-022-01849-w
- By:
- Publication type:
- Article
5
Fixed parameter approximation scheme for min-max k-cut.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1093, doi. 10.1007/s10107-022-01842-3
- By:
- Publication type:
- Article
6
Improving the approximation ratio for capacitated vehicle routing.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 451, doi. 10.1007/s10107-022-01841-4
- By:
- Publication type:
- Article
7
Affinely representable lattices, stable matchings, and choice functions.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 721, doi. 10.1007/s10107-022-01838-z
- By:
- Publication type:
- Article
8
The double exponential runtime is tight for 2-stage stochastic ILPs.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1145, doi. 10.1007/s10107-022-01837-0
- By:
- Publication type:
- Article
9
Speed-robust scheduling: sand, bricks, and rocks.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1009, doi. 10.1007/s10107-022-01829-0
- By:
- Publication type:
- Article
10
On the integrality gap of binary integer programs with Gaussian data.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1221, doi. 10.1007/s10107-022-01828-1
- By:
- Publication type:
- Article
11
On the geometry of symmetry breaking inequalities.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 693, doi. 10.1007/s10107-022-01819-2
- By:
- Publication type:
- Article
12
Complexity, exactness, and rationality in polynomial optimization.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 661, doi. 10.1007/s10107-022-01818-3
- By:
- Publication type:
- Article
13
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 847, doi. 10.1007/s10107-022-01817-4
- By:
- Publication type:
- Article
14
Online k-taxi via Double Coverage and time-reverse primal-dual.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 499, doi. 10.1007/s10107-022-01815-6
- By:
- Publication type:
- Article
15
On the implementation and strengthening of intersection cuts for QCQPs.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 549, doi. 10.1007/s10107-022-01808-5
- By:
- Publication type:
- Article
16
Robust k-center with two types of radii.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 991, doi. 10.1007/s10107-022-01799-3
- By:
- Publication type:
- Article
17
Proximity bounds for random integer programs.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1201, doi. 10.1007/s10107-022-01786-8
- By:
- Publication type:
- Article
18
Exact solution of network flow models with strong relaxations.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 813, doi. 10.1007/s10107-022-01785-9
- By:
- Publication type:
- Article
19
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1049, doi. 10.1007/s10107-022-01780-0
- By:
- Publication type:
- Article
20
Approximating the discrete time-cost tradeoff problem with bounded depth.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 529, doi. 10.1007/s10107-022-01777-9
- By:
- Publication type:
- Article
21
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 761, doi. 10.1007/s10107-022-01772-0
- By:
- Publication type:
- Article
22
Lifting convex inequalities for bipartite bilinear programs.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 587, doi. 10.1007/s10107-021-01759-3
- By:
- Publication type:
- Article
23
Implications, conflicts, and reductions for Steiner trees.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 903, doi. 10.1007/s10107-021-01757-5
- By:
- Publication type:
- Article
24
Computational aspects of relaxation complexity: possibilities and limitations.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1173, doi. 10.1007/s10107-021-01754-8
- By:
- Publication type:
- Article
25
A computational status update for exact rational mixed integer programming.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 793, doi. 10.1007/s10107-021-01749-5
- By:
- Publication type:
- Article
26
Sum-of-squares hierarchies for binary polynomial optimization.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 621, doi. 10.1007/s10107-021-01745-9
- By:
- Publication type:
- Article
27
A tight approximation algorithm for the cluster vertex deletion problem.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 1069, doi. 10.1007/s10107-021-01744-w
- By:
- Publication type:
- Article