Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 1, doi. 10.1007/s10107-025-02205-4
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2025 AND VI 210 AND IP 1
Results: 30
1
2
Cut-sufficient directed 2-commodity multiflow topologies: Cut-sufficient directed 2-commodity multiflow topologies: J. Poremba, F. B. Shepherd.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 793, doi. 10.1007/s10107-025-02195-3
- By:
- Publication type:
- Article
3
A 43-approximation algorithm for half-integral cycle cut instances of the TSP: A 43-approximation algorithm for half-integral cycle...: B. Jin et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 511, doi. 10.1007/s10107-025-02193-5
- By:
- Publication type:
- Article
4
Monoidal strengthening of simple V-polyhedral disjunctive cuts: Monoidal strengthening of simple...: A. M. Kazachkov, E. Balas.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 567, doi. 10.1007/s10107-024-02185-x
- By:
- Publication type:
- Article
5
Towards an optimal contention resolution scheme for matchings: Towards an optimal contention resolution scheme...: P. Nuti, J. Vondrák.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 761, doi. 10.1007/s10107-024-02178-w
- By:
- Publication type:
- Article
6
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid: Constant-competitiveness for random...: R. Santiago et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 815, doi. 10.1007/s10107-024-02177-x
- By:
- Publication type:
- Article
7
Stabilization of capacitated matching games: Stabilization of capacitated matching games: M. Gerstbrein et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 313, doi. 10.1007/s10107-024-02169-x
- By:
- Publication type:
- Article
8
The polyhedral geometry of truthful auctions: The polyhedral geometry of truthful...: M. Joswig et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 539, doi. 10.1007/s10107-024-02168-y
- By:
- Publication type:
- Article
9
Advances on strictly Δ-modular IPs: Advances on strictly Δ-modular IPs: M. Nägele et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 731, doi. 10.1007/s10107-024-02148-2
- By:
- Publication type:
- Article
10
A nearly optimal randomized algorithm for explorable heap selection: A nearly optimal randomized algorithm...: S. Borst et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 75, doi. 10.1007/s10107-024-02145-5
- By:
- Publication type:
- Article
11
Decomposition of probability marginals for security games in max-flow/min-cut systems: Decomposition of probability marginals in max-flow/min-cut systems: J. Matuschke.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 611, doi. 10.1007/s10107-024-02144-6
- By:
- Publication type:
- Article
12
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty: Recycling valid inequalities for robust combinatorial...: C. Büsing et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 97, doi. 10.1007/s10107-024-02135-7
- By:
- Publication type:
- Article
13
Optimizing for strategy diversity in the design of video games: Designing optimization problems with diverse solutions: O. Hanguir et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 335, doi. 10.1007/s10107-024-02126-8
- By:
- Publication type:
- Article
14
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints: A fast combinatorial algorithm for the bilevel knapsack...: N. Weninger, R. Fukasawa.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 847, doi. 10.1007/s10107-024-02133-9
- By:
- Publication type:
- Article
15
From approximate to exact integer programming: From approximate to exact integer programming: D. Dadush et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 223, doi. 10.1007/s10107-024-02084-1
- By:
- Publication type:
- Article
16
Configuration balancing for stochastic requests: Configuration balancing for stochastic requests: F. Eberle et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 243, doi. 10.1007/s10107-024-02132-w
- By:
- Publication type:
- Article
17
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 457, doi. 10.1007/s10107-024-02118-8
- By:
- Publication type:
- Article
18
An update-and-stabilize framework for the minimum-norm-point problem.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 281, doi. 10.1007/s10107-024-02077-0
- By:
- Publication type:
- Article
19
Compressing branch-and-bound trees.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 669, doi. 10.1007/s10107-024-02080-5
- By:
- Publication type:
- Article
20
On the correlation gap of matroids: On the correlation gap of matroids: E. Husić et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 407, doi. 10.1007/s10107-024-02116-w
- By:
- Publication type:
- Article
21
Efficient separation of RLT cuts for implicit and explicit bilinear terms: Efficient separation of RLT cuts for implicit and explicit...: K. Bestuzheva et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 47, doi. 10.1007/s10107-024-02104-0
- By:
- Publication type:
- Article
22
Monoidal strengthening and unique lifting in MIQCPs: Monoidal strengthening and unique lifting in MIQCPs: A. Chmiela et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 189, doi. 10.1007/s10107-024-02112-0
- By:
- Publication type:
- Article
23
Information complexity of mixed-integer convex optimization: Information complexity of mixed-integer...: A. Basu et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 3, doi. 10.1007/s10107-024-02099-8
- By:
- Publication type:
- Article
24
Optimal general factor problem and jump system intersection: Optimal general factor problem and jump system intersection: Y. Kobayashi.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 591, doi. 10.1007/s10107-024-02098-9
- By:
- Publication type:
- Article
25
Exploiting the polyhedral geometry of stochastic linear bilevel programming: Exploiting the polyhedral geometry of stochastic linear...: G. Muñoz et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 695, doi. 10.1007/s10107-024-02097-w
- By:
- Publication type:
- Article
26
ReLU neural networks of polynomial size for exact maximum flow computation: Poly-size ReLU neural networks for maximum flow computation: C. Hertrich, L. Sering.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 377, doi. 10.1007/s10107-024-02096-x
- By:
- Publication type:
- Article
27
Multiplicative auction algorithm for approximate maximum weight bipartite matching.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 881, doi. 10.1007/s10107-024-02066-3
- By:
- Publication type:
- Article
28
A characterization of maximal homogeneous-quadratic-free sets: A characterization of maximal homogeneous-quadratic-free...: G. Muñoz et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 641, doi. 10.1007/s10107-024-02092-1
- By:
- Publication type:
- Article
29
A linear time algorithm for linearizing quadratic and higher-order shortest path problems: A linear time algorithm for linearizing quadratic...: E. Çela et al.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 165, doi. 10.1007/s10107-024-02086-z
- By:
- Publication type:
- Article
30
Inapproximability of shortest paths on perfect matching polytopes: Inapproximability of shortest paths on perfect matching polytopes: J. Cardinal, R. Steiner.
- Published in:
- Mathematical Programming, 2025, v. 210, n. 1, p. 147, doi. 10.1007/s10107-023-02025-4
- By:
- Publication type:
- Article