Pith. sign in

REVIEW 5 minor 169 references

Exploiting Variable Implications in Presolve for Mixed Integer Programming

T0 review · 0 major / 5 minor · reviewed 2026-07-11 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Two new presolve methods that exploit variable implications cut HiGHS solving time by 4% and nodes by 6% on MIPLIB 2017.

desk verdict Two clean, linear-time VI-based presolve routines that deliver a measurable 4%/6% speed-up inside HiGHS and strictly dominate the 2013 cover method. read the letter →

arxiv 2607.04313 v1 pith:SU35Z2K7 submitted 2026-07-05 math.OC

Wei-Kun Chen , Chang-Long Li , Zhao-Wei Wang , Yu-Hong Dai , Zi-Shuo Li , Meng Lu This is my paper · ORCID
classification math.OC MSC 90C1190C57
keywords mixedintegerprogrammingpresolvevariableimplicationconstraintaggregationboundtighteningcliquelinearpropagation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Modern MIP solvers already store variable implications—rules that say how fixing a binary variable forces tighter bounds on other variables. This paper shows how to put those rules to work inside the presolve stage itself. The first method, VI aggregation, folds many such implications that share a clique into one stronger inequality; the second, VI-aware linear-constraint propagation, uses the same implications while tightening bounds so that the tightest possible bound can still be found in linear time. Together the two routines shrink the formulation, strengthen its LP relaxation, and measurably reduce the size of the branch-and-cut tree. On the standard MIPLIB 2017 suite the combined techniques cut shifted geometric-mean solving time by 4% and node count by 6% inside the open-source solver HiGHS, while the bound-tightening method alone already produces strictly tighter bounds than the previous cover-based technique.

What carries the argument

VI-aware linear constraint propagation: the implied activity of a linear constraint after the implications of the variable being tightened are enforced; the resulting piecewise-linear function can still be optimized over each interval in overall linear time, producing the tightest feasible bound.

What would settle it

Re-run the MIPLIB 2017 experiments with the two techniques disabled versus enabled inside HiGHS; if the shifted geometric means of time and nodes do not improve by roughly 4% and 6% respectively, the central performance claim fails.

Watch

Extended reading notes

Core claim

Variable implications that modern MIP solvers already maintain can be turned into two practical presolve reductions: (1) aggregating several implications that share a clique into a single dominating inequality, and (2) a linear-time bound-propagation procedure that uses those same implications and yields strictly tighter variable bounds than the cover-based method of Achterberg et al. (2013). On MIPLIB 2017 the two techniques together reduce HiGHS solving time by 4% and node count by 6%.

Load-bearing premise

Both the linear-time claim and the observed speed-ups rest on the solver already possessing a complete, non-redundant collection of variable implications in its clique table and VI graph.

Editorial extensions

If this is right

  • Any MIP solver that already stores clique tables and VI graphs can obtain stronger formulations and smaller search trees by inserting these two routines into its presolve loop.
  • VI aggregation simultaneously reduces the number of rows and tightens the LP relaxation whenever the aggregated implications appear as original constraints.
  • VI-aware LCP can be applied not only to ordinary rows but also to objective-based cuts, producing bound reductions that hold for all optimal solutions.
  • The same linear-time machinery can be reused to generate additional binary implications (cliques and covering relations) that further strengthen later cut separation and branching.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the methods never require the original constraint matrix to be sparse, they remain useful for dense formulations that arise from reformulations or cutting-plane loops.
  • The same aggregation and propagation ideas extend immediately to mixed-integer nonlinear programs that possess linear inequalities and maintain VIs.
  • If a solver can cheaply certify completeness of its VI graph, the linear-time guarantee becomes a formal certificate that no stronger single-constraint bound exists.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper proposes two presolve techniques that exploit variable implications (VIs) already maintained by modern MIP solvers. VI aggregation combines several VIs that share a common continuous or integer variable and whose binary variables form a clique into a single aggregated inequality; the construction generalizes classical clique merging and can both reduce the number of constraints and strengthen the LP relaxation. VI-aware linear constraint propagation (LCP) augments ordinary LCP by incorporating the VIs associated with the variable being tightened; the authors prove that the resulting tightest lower/upper bound can still be computed in linear time (Propositions 1–2 and the O(|B|)-time update after Eq. (38)) and that the bounds dominate those obtained by the cover-based method of Achterberg et al. (2013) (Theorem 1, Examples 6–7). Both routines are implemented in HiGHS and evaluated on the MIPLIB 2017 suite (five seeds). Together they produce a 4 % reduction in shifted geometric-mean solving time and a 6 % reduction in node count (Table 6).

Significance. If the claims hold, the work supplies two practical, theoretically justified presolve reductions that improve a production open-source MIP solver on a standard public benchmark. The linear-time algorithms, the formal dominance proof over the 2013 cover technique, and the concrete counter-examples that exhibit strictly tighter bounds are clear strengths. The experimental protocol (MIPLIB 2017, five seeds, shifted geometric means, affected-instance analysis) is conventional and transparent. The techniques rely only on data structures already present in modern solvers, so the barrier to adoption is low. The absolute gains are modest but consistent with the incremental nature of modern MIP presolve research and are therefore of genuine interest to the computational MIP community.

minor comments (5)
  1. Assumption 1(iv)–(v) and Remark 1 are stated only for the lower/upper pairs that share the same binary fixing; a short sentence clarifying that complementary pairs (e.g., xi=0 o xj≥a and xi=1 o xj≤b) are already handled by the clique table would remove a possible source of confusion.
  2. In Algorithm 1 the greedy selection of the clique that maximises |C igcap K| is left without a complexity remark; a one-line note that the operation can be realised with the existing clique-table adjacency lists would be helpful.
  3. The two enhancements of Section 4.5 (objective-based bounds and derivation of additional VIs) are described only at a high level; a short pseudocode fragment or a pointer to the corresponding lines in the HiGHS implementation would improve reproducibility.
  4. Tables 1–6 report only shifted geometric means; adding the number of instances on which each method is strictly faster (or the win/tie/loss counts) would make the practical impact easier to assess at a glance.
  5. A few typographical slips remain (e.g., “Awiderangeofpresolvetechniques” on p. 1, missing spaces after some equation numbers). A careful proof-reading pass is recommended.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: all reductions and complexity claims follow directly from the input MIP, Assumption 1, and the already-available clique/VI data structures; empirical gains are measured against an independent baseline.

full rationale

The paper’s two techniques (VI aggregation via clique covers in Algorithm 1 / Section 3, and VI-aware LCP via implied-activity functions wr(·) and Proposition 2 / Section 4) are derived by rewriting the definitions of variable implications (2a)–(2d) and (3a)–(3d) together with a single linear constraint and integrality. Theorem 1 compares the resulting optimization problems (45a)–(45b) with the cover-based bounds (43)–(44) of Achterberg et al. (2013) by elementary set inclusion; the comparison does not rely on any fitted parameter or self-referential normalization. Linear-time complexity follows from a single left-to-right sweep that updates the piecewise-linear wr values (equation (38)). Computational claims are ordinary shifted-geometric-mean measurements of HiGHS (with and without the new routines) on the public MIPLIB 2017 suite; no quantity is predicted from a fit to a subset of the same data. Self-citations (e.g., Dai & Chen 2026) appear only as related work and are not load-bearing for any correctness or complexity argument. Consequently the derivation chain is self-contained and free of the six circularity patterns.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The paper works entirely inside the standard MIP model and the already-standard data structures (clique table, VI graph) maintained by modern solvers. No free parameters are fitted; the only modeling choices are the usual finite-bound and non-redundancy assumptions that every MIP presolver already makes.

assumptions (3)
  • domain assumption All variable lower bounds are zero and all upper bounds are finite (Section 2).
    Simplifies notation; the authors note that the results extend, but the complexity proofs are written under this restriction.
  • domain assumption Variable implications stored in the clique table and VI graph are non-redundant and satisfy the five technical conditions of Assumption 1.
    Required for the correctness of both aggregation and the activity formulas; standard in MIP solvers but not automatically true for every raw model.
  • ad hoc to paper A minimal clique cover of the relevant binary indices can be constructed by the greedy heuristic of Algorithm 1.
    Exact minimum clique cover is NP-hard; the paper uses a practical heuristic whose quality is not theoretically guaranteed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Exploiting Variable Implications in Presolve for Mixed Integer Programming." pith.science (2026). https://pith.science/paper/SU35Z2K7

@misc{pith2026260704313,
  author       = {Pith},
  title        = {Pith review of: Exploiting Variable Implications in Presolve for Mixed Integer Programming},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SU35Z2K7}},
  note         = {Machine review of arXiv:2607.04313}
}
read the original abstract

Presolve for mixed integer programming (MIP) problems aims to eliminate redundant information, strengthen the formulation, and extract useful structural information for the subsequent branch-and-cut process. An important type of such structural information is the variable implications (VIs), which describe how a bound on a variable depends on a bound of a binary variable. In this paper, we develop two new presolve techniques that exploit VIs to derive reductions for MIP problems. The first technique, called VI aggregation, aggregates multiple VIs into a single inequality by using implications between a variable and a set of binary variables that form a clique. This aggregation can reduce the number of constraints and tighten the linear programming relaxation. The second technique, called VI-aware linear constraint propagation (LCP), builds on the standard LCP but incorporates VIs associated with the variable being tightened to derive more reductions and can derive tighter variable bounds. We show that although VI information is additionally considered, the tightest lower or upper bound of a variable can still be derived in linear time. Moreover, compared with a state-of-the-art approach in the literature, the proposed VI-aware LCP can derive tighter variable bounds. Computational results on MIPLIB 2017 benchmark instances demonstrate the effectiveness of VI aggregation and VI-aware LCP in improving the performance of the open-source MIP solver HiGHS. In particular, using the two proposed presolve techniques, a reduction of 4% in solving time and 6% in node number on HiGHS can be achieved.

Figures

Figures reproduced from arXiv: 2607.04313 by the authors.

Figure 1
Figure 1. Illustration of function w5(·) in Example 4. and the following VIs of x6 ∈ [0, 4]: x6 < 3 → x1 = 1, (55a) x6 < 3 → x2 = 1, (55b) x6 < 2 → x3 = 1, (55c) x6 < 2 → x4 = 1, (55d) x6 > 1 → x5 = 1. (55e) For VIs in (55a)–(55e), we obtain B < 1 (6) = {1, 2, 3, 4} , ℓ16 = ℓ26 = 3, ℓ36 = ℓ46 = 2, B > 1 (6) = {5}, and u56 = 1. Using the presolve technique in Achterberg et al. (2013) to tighten the lower bound of variable x6, … view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

169 extracted references · 17 canonical work pages

  1. [1]

    Hoen, Alexander and Kamp, Dominik and Gleixner, Ambros , journal = IJOC, month =

  2. [2]

    arXiv , arxivId =:2510.20499 , file =

    arXiv

  3. [3]

    Annals of Operations Research , keywords =

    Atamt. Annals of Operations Research , keywords =. doi:10.1007/s10479-005-3968-2 , file =

    work page doi:10.1007/s10479-005-3968-2

  4. [4]

    and Szymanski, Ralf , file =

    Suhl, Uwe H. and Szymanski, Ralf , file =

  5. [5]

    Dai, Yongzheng and Chen, Chen , file =

  6. [6]

    Integration of Constraint Programming, Artificial Intelligence, and Operations Research , file =

    Hoen, Alexander and Oertel, Andy and Gleixner, Ambros and Nordstr. Integration of Constraint Programming, Artificial Intelligence, and Operations Research , file =

  7. [7]

    van der Hulst, Rolf and Walter, Matthias , booktitle =

  8. [8]

    von Holly-Ponientzietz, Jacob and Hoen, Alexander and Turner, Mark and Gleixner, Ambros , eprint =

Show all 169 references
  1. [9]

    Cederberg, Daniel and Boyd, Stephen , eprint =

  2. [10]

    Zhang, Yi and Ploskas, Nikolaos and Sahinidis, Nikolaos V , journal = MPC, number =

  3. [11]

    Kempke, Nils-Christian and Maher, Stephen J and Rehfeldt, Daniel and Gleixner, Ambros and Koch, Thorsten and Uslu, Svenja , eprint =

  4. [12]

    Gamrath, Gerald and Berthold, Timo and Heinz, Stefan and Winkler, Michael , file =

  5. [13]

    Mathematical Programming , number =

    Dentcheva, Darinka and Pr. Mathematical Programming , number =. doi:10.1007/PL00011393 , issn =

    doi

  6. [14]

    Lejeune, Miguel and Noyan, Nilay , journal = EJOR, keywords =

  7. [15]

    Luedtke, James and Ahmed, Shabbir and Nemhauser, George L , journal = MP, number =

  8. [16]

    Journal of the Operational Research Society , month =

    Lejeune, M A , doi =. Journal of the Operational Research Society , month =

  9. [17]

    Pratt, Rob and Christophel, Philipp and Guzelsoy, Menal and Ladanyi, Laci , file =

  10. [18]

    Belotti, Pietro and Cafieri, Sonia and Lee, Jon and Liberti, Leo , editor =

  11. [19]

    doi:10.1007/978-1-4615-2025-2_14 , editor =

    Ratschek, Helmut and Rokne, Jon , booktitle =. doi:10.1007/978-1-4615-2025-2_14 , editor =

    2025 doi

  12. [20]

    doi:10.2307/2153591 , file =

    Hansen, Eldon , booktitle =. doi:10.2307/2153591 , file =

    doi

  13. [21]

    Artificial Intelligence , number =

    Davis, Ernest , doi =. Artificial Intelligence , number =

  14. [22]

    Journal of Global Optimization , number =

    Shectman, J Parker and Sahinidis, Nikolaos V , doi =. Journal of Global Optimization , number =

  15. [23]

    Computers

    Quesada, I and Grossmann, I E , doi =. Computers

  16. [24]

    Journal of Global Optimization , keywords =

    Belotti, Pietro , doi =. Journal of Global Optimization , keywords =

  17. [25]

    Salvagnin, Domenico and Roberti, Roberto and Fischetti, Matteo , journal = MPC, number =

  18. [26]

    Cut-based conflict analysis in mixed integer programming , url =

    Mexi, Gioni and Serrano, Felipe and Berthold, Timo and Gleixner, Ambros and Nordstr. Cut-based conflict analysis in mixed integer programming , url =. arXiv , arxivId =:2410.15110 , file =

  19. [27]

    Mathematical Programming Computation , keywords =

    Witzig, Jakob and Berthold, Timo and Heinz, Stefan , doi =. Mathematical Programming Computation , keywords =

  20. [28]

    Danna, E , booktitle =

  21. [29]

    Performance variability in mixed-integer programming , year =

    Lodi, Andrea and Tramontani, Andrea , booktitle =. Performance variability in mixed-integer programming , year =

  22. [30]

    Kılınç, Mustafa R and Sahinidis, Nikolaos V , issn =

  23. [31]

    Ralphs, Ted K and Galati, Matthew V , booktitle =

  24. [32]

    Ralphs, Ted and Shinano, Yuji and Berthold, Timo and Koch, Thorsten , file =

  25. [33]

    Balas, Egon and Zemel, Eitan , doi =

  26. [34]

    INFORMS J

    Achterberg, Tobias and Bixby, Robert E and Gu, Zonghao and Rothberg, Edward and Weninger, Dieter , doi =. INFORMS J. on Computing , keywords =

  27. [35]

    Gamrath, Gerald and Koch, Thorsten and Martin, Alexander and Miltenberger, Matthias and Weninger, Dieter , file =

  28. [36]

    Operations Research Letters , doi =

    Amor, Hatem Ben and Desrosiers, Jacques and Soumis, Fran. Operations Research Letters , doi =

  29. [37]

    and Yinyu, Ye , booktitle =

    Wilson, J. and Yinyu, Ye , booktitle =. doi:10.2307/254021 , file =

    doi

  30. [38]

    Mathematical Programming, Series B , doi =

    Fukuda, Komei and Terlaky, Tam. Mathematical Programming, Series B , doi =

  31. [39]

    Hoffman, Karla L and Padberg, Manfred , journal =

  32. [40]

    Cook, Stephen A , booktitle =

  33. [41]

    2021 , url=

    Bestuzheva, Ksenia and Besan. 2021 , url=

    2021

  34. [42]

    and Cook, William and Cox, Alan and Lee, Eva K

    Bixby, Robert E. and Cook, William and Cox, Alan and Lee, Eva K. , booktitle =. doi:10.1023/a:1018960631213 , file =

    doi

  35. [43]

    Puranik, Yash and Sahinidis, Nikolaos V , doi =

  36. [44]

    Hall, Julian , file =

  37. [45]

    Poirrier, Laurent , file =

  38. [46]

    Galabova, Ivet , file =

  39. [47]

    Crowder, Harlan and Johnson, Ellis L and Padberg, Manfred , journal = OR, number =

  40. [48]

    Savelsbergh, M. W. P. , file =

  41. [49]

    Czyzyk, Joseph and Mehrotra, Sanjay and Wagner, Michael and Wright, Stephen J. , doi =

  42. [50]

    35th International Conference on Machine Learning, ICML 2018 , month =

    Balcan, Maria Fiorina and Tyavis, Dick and Sandholm, Thomas and Vitercik, Ellen , eprint =. 35th International Conference on Machine Learning, ICML 2018 , month =

    2018

  43. [51]

    Gould, Nick and Toint, Philippe L. , doi =

  44. [52]

    RAIRO - Operations Research , number =

  45. [53]

    Hopper, M J , file =

  46. [54]

    Dantzig, George B. , doi =

  47. [55]

    OR Spectrum , keywords =

    M. OR Spectrum , keywords =. doi:10.1007/s00291-003-0130-x , file =

    doi

  48. [56]

    Wilson, Greg and Aruliah, D. A. and Brown, C. Titus and. PLoS Biology , number =. doi:10.1371/journal.pbio.1001745 , eprint =

    doi

  49. [57]

    Chopra, Sunil and Rao, M. R. , doi =

  50. [58]

    doi:10.1007/978-3-319-63516-3_8 , editor =

    Ralphs, Ted and Isaac, Fair and Gmbh, Germany and Koch, Thorsten and Ralphs, Ted and Shinano, Yuji and Berthold, Timo , booktitle =. doi:10.1007/978-3-319-63516-3_8 , editor =

    doi

  51. [59]

    and Wallace, John J

    Fleming, Philip J. and Wallace, John J. , doi =. Communications of the ACM , keywords =

  52. [60]

    Nesterov, Y and Frek, H and Roos, K and Terlaky, T and Zhang, S , file =

  53. [61]

    Chan, W. M. and George, Alan , doi =. Bit , number =

  54. [62]

    doi:10.1137/1.9780898718003 , file =

    Saad, Yousef , booktitle =. doi:10.1137/1.9780898718003 , file =

    doi

  55. [63]

    Annals of Operations Research , number =

    Lach, Gerald and L. Annals of Operations Research , number =. doi:10.1007/s10479-010-0700-7 , issn =

    doi

  56. [64]

    Brearley, A L and Mitra, G and Williams, H P , journal = MP, number =

  57. [65]

    Brito, Samuel Souza , file =

  58. [66]

    Journal of the Society for Industrial and Applied Mathematics , number =

    Wolfe, Philip , doi =. Journal of the Society for Industrial and Applied Mathematics , number =

  59. [67]

    Berthold, Timo and Farmer, James and Heinz, Stefan and Perregaard, Michael , doi =

  60. [68]

    Wiley Blackwell 6 , doi =

  61. [69]

    and Andersen, Knud D

    Andersen, Erling D. and Andersen, Knud D. , file =

  62. [70]

    and D.K.Wagner , doi =

    Bixby, R.E. and D.K.Wagner , doi =. Operations Research Letters , keywords =

  63. [71]

    Management Science , month =

    Markowitz, Harry M , doi =. Management Science , month =

  64. [72]

    Johnson, Ellis L and Suhl, Uwe H , journal = DAM, number =

  65. [73]

    Achterberg, Tobias and Wunderling, Roland , booktitle =

  66. [74]

    Galabova, I. L. and Hall, J. A.J. , doi =

  67. [75]

    ACM Transactions on Mathematical Software , keywords =

    Luce, R and. ACM Transactions on Mathematical Software , keywords =

  68. [76]

    Koberstein, Achim , booktitle =

  69. [77]

    doi:10.1007/978-3-031-08011-1_3 , file =

    Berthold, Timo and Hendel, Gregor and Salvagnin, Domenico , booktitle =. doi:10.1007/978-3-031-08011-1_3 , file =

    doi

  70. [78]

    Parallel Computing , keywords =

    Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian , doi =. Parallel Computing , keywords =

  71. [79]

    Vuduc, Richard W , file =

  72. [80]

    SIAM Journal on Optimization , keywords =

    Mehrotra, Sanjay , doi =. SIAM Journal on Optimization , keywords =

  73. [81]

    , file =

    Swietanowski, A. , file =

  74. [82]

    Gamrath, Gerald and Berthold, Timo and Salvagnin, Domenico , file =

  75. [83]

    Hendel, Gregor and Berthold, Timo , file =

  76. [84]

    Koberstein, Achim , doi =

  77. [85]

    doi:10.1007/s10957-016-0892-3 , eprint =

    O'Donoghue, Brendan and Chu, Eric and Parikh, Neal and Boyd, Stephen , booktitle =. doi:10.1007/s10957-016-0892-3 , eprint =

    doi

  78. [86]

    Dolan, Elizabeth D. and Mor. Mathematical Programming, Series B , keywords =. doi:10.1007/s101070100263 , eprint =

    doi

  79. [87]

    Andersen, Erling D. , doi =

  80. [88]

    7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems , keywords =

    Bornd. 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems , keywords =

  81. [89]

    Achterberg, Tobias , doi =

  82. [90]

    Lougee-Heimer, R. , doi =. IBM Journal of Research and Development , number =

  83. [91]

    Ge, Dongdong and Huangfu, Qi and Wang, Zizhuo and Wu, Jian and Ye, Yinyu , howpublished =

  84. [92]

    and Hall, J

    Huangfu, Q. and Hall, J. A.J. , file =

  85. [93]

    Gamrath, Gerald , doi =

  86. [94]

    Handbooks in Operations Research and Management Science , number =

    F. Handbooks in Operations Research and Management Science , number =. doi:10.1016/S0927-0507(05)12002-7 , file =

    doi

  87. [95]

    and Rousseau, Louis Martin , booktitle =

    Bajgiran, Omid Sanei and Cire, Andre A. and Rousseau, Louis Martin , booktitle =. doi:10.1007/978-3-319-59776-8_18 , editor =

    doi

  88. [96]

    Liu, Wai Hung and Sherman, Andrew H. , doi =. SIAM Journal on Numerical Analysis , number =

  89. [97]

    Gondzio, Jacek , doi =

  90. [98]

    and Boman, Erik G

    Devine, Karen D. and Boman, Erik G. and Karypis, George , doi =. Parallel Processing for Scientific Computing , pages =

  91. [99]

    Corporation, Intel , booktitle =

  92. [100]

    Boland, Natashia and Bley, Andreas and Fricke, Christopher and Froyland, Gary and Sotirov, Renata , doi =

  93. [101]

    Balas, Egon and Martin, Clarence H , journal =

  94. [102]

    Bertrand, Jean and Jacques, Gauthier and Lu, Marco E , doi =

  95. [103]

    ACMJournal of Experimental Algorithmics , number =

    Bergner, Martin and L. ACMJournal of Experimental Algorithmics , number =. doi:10.1145/2851492 , file =

    doi

  96. [104]

    doi:10.1287/ijoc.13.2.169.10519 , file =

    M. doi:10.1287/ijoc.13.2.169.10519 , file =

    doi

  97. [105]

    and Goldfarb, D

    Alizadeh, F. and Goldfarb, D. , doi =. Mathematical Programming, Series B , month =

  98. [106]

    Achterberg, Tobias and Sabharwal, Ashish and Samulowitz, Horst , booktitle =

  99. [107]

    Guignard, Monique and Spielberg, Kurt , journal = OR, number =

  100. [108]

    doi:10.1109/TAI.2003.1250177 , isbn =

    Lynce, I and Marques-Silva, J , booktitle =. doi:10.1109/TAI.2003.1250177 , isbn =

    2003 doi arXiv

  101. [109]

    Andersen, Kent and Pochet, Yves , booktitle = MP, doi =

  102. [110]

    and Abramowitz, Milton and Stegun, Irene A

    H., C. and Abramowitz, Milton and Stegun, Irene A. , doi =. Journal of the American Statistical Association , number =

  103. [111]

    Miltenberger, Matthias , file =

  104. [112]

    European Journal of Operational Research , keywords =

    Clautiaux, Fran. European Journal of Operational Research , keywords =. doi:10.1016/j.ejor.2024.11.018 , file =

    2024 doi

  105. [113]

    Davis, Timothy A and Rajamanickam, Sivasankaran and Sid-Lakhdar, Wissam , file =

  106. [114]

    Achterberg, Tobias , booktitle =

  107. [115]

    人工神经网络-9-11章 , year =

  108. [116]

    Megiddo, Nimrod , booktitle = OJC, doi =

  109. [117]

    , booktitle =

    Paige, Robert and Tarjan, Robert E. , booktitle =. doi:10.1137/0216062 , file =

    doi

  110. [118]

    Li, Xiaoye S. , doi =. ACM Transactions on Mathematical Software , keywords =

  111. [119]

    and Choi, Seung Jin and Buyuktahtakin, I

    Cooper, Joshua F. and Choi, Seung Jin and Buyuktahtakin, I. Esra , eprint =

  112. [120]

    and Nemhauser, George L

    Klabjan, Diego and Johnson, Ellis L. and Nemhauser, George L. , booktitle =. doi:10.1016/s0167-6377(00)00017-1 , file =

    doi

  113. [121]

    Gleixner, Ambros and Hendel, Gregor and Gamrath, Gerald and Achterberg, Tobias and Bastubbe, Michael and Berthold, Timo and Christophel, Philipp and Jarck, Kati and Koch, Thorsten and Linderoth, Jeff and L

  114. [122]

    New Scientist , number =

    Elwes, Richard , doi =. New Scientist , number =

  115. [123]

    Operations Research Letters , keywords =

    Achterberg, Tobias and Koch, Thorsten and Martin, Alexander , doi =. Operations Research Letters , keywords =

  116. [124]

    and Davis, Timothy A

    Amestoy, Patrick R. and Davis, Timothy A. and Duff, Iain S. , booktitle =. doi:10.1145/1024074.1024081 , file =

    doi

  117. [125]

    Parallel Algorithms and Applications , keywords =

    Hafsteinsson, Hj. Parallel Algorithms and Applications , keywords =. doi:10.1080/10637199408915470 , file =

    doi

  118. [126]

    Russell, Michael , booktitle =

  119. [127]

    and Duff, Iain S

    Davis, Timothy A. and Duff, Iain S. , doi =. SIAM Journal on Matrix Analysis and Applications , keywords =

  120. [128]

    Schork, Lukas and Gondzio, Jacek , doi =

  121. [129]

    Fukasawa, Ricardo and Poirrier, Laurent , doi =

  122. [130]

    Christopher , file =

    Heinz, Stefan and Schulz, Jens and Beck, J. Christopher , file =. Constraints , keywords =

  123. [131]

    Hoffman, Karla L and Padberg, Manfred , journal = OJC, month =

  124. [132]

    and Shao, Meiyue , booktitle =

    Li, Xiaoye S. and Shao, Meiyue , booktitle =. doi:10.1145/1916461.1916467 , file =

    doi

  125. [133]

    and Gauthier, J

    Benichou, M. and Gauthier, J. M. and Hentges, G. and Ribiere, G. , doi =

  126. [134]

    INFORMS Journal on Optimization , month =

    Matter, Frederic and Pfetsch, Marc E , doi =. INFORMS Journal on Optimization , month =

  127. [135]

    doi:10.1016/j.ejor.2020.07.063 , eprint =

    Bengio, Yoshua and Lodi, Andrea and Prouvost, Antoine , booktitle =. doi:10.1016/j.ejor.2020.07.063 , eprint =

    2020 doi

  128. [136]

    Proceedings of Machine Learning Research , pages =

    Gao, Wenzhi and Ge, Dongdong and Sun, Chunlin and Ye, Yinyu , file =. Proceedings of Machine Learning Research , pages =

  129. [137]

    Marchand, Hugues and Wolsey, Laurence A , journal = OR, keywords =

  130. [138]

    Berthold, Timo and Gamrath, Gerald and Salvagnin, Domenico , file =

  131. [139]

    Dietrich, B. L. and Escudero, L. F. and Chance, F. , doi =

  132. [140]

    Tomlin, J. A. , booktitle =. doi:10.1007/bfb0120718 , file =

    doi

  133. [141]

    ACM SIGARCH Computer Architecture News , keywords =

    Olszewski, Marek and Ansel, Jason and Amarasinghe, Saman , doi =. ACM SIGARCH Computer Architecture News , keywords =

  134. [142]

    Arxiv , month =

    Ge, Dongdong and Wang, Chengwenjian and Xiong, Zikai and Ye, Yinyu , eprint =. Arxiv , month =

  135. [143]

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , pages =

    Grohe, Martin and Kersting, Kristian and Mladenov, Martin and Selman, Erkal , doi =. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , pages =. arXiv , arxivId =:1307.5697 , file =

    arXiv

  136. [144]

    and Gu, Zonghao and Rothberg, Edward and Weninger, Dieter , journal = IJOC, keywords =

    Achterberg, Tobias and Bixby, Robert E. and Gu, Zonghao and Rothberg, Edward and Weninger, Dieter , journal = IJOC, keywords =

  137. [145]

    Borwein, Jonathan M and Lewis, Adrian S , isbn =

  138. [146]

    算法导论中文版 , url =

    潘金贵 , file =. 算法导论中文版 , url =

  139. [147]

    Corp., Intel , booktitle =

  140. [148]

    A.Julian , doi =

    Huangfu, Qi and Hall, J. A.Julian , doi =. Computational Optimization and Applications , keywords =

  141. [149]

    Cplex, I B M ILOG , journal =

  142. [150]

    Huangfu, Qi , file =

  143. [151]

    Achterberg, Tobias , file =

  144. [152]

    Koch, Thorsten and Berthold, Timo and Pedersen, Jaap and Vanaret, Charlie , doi =

  145. [153]

    , booktitle =

    Wolsey, Laurence A. , booktitle =

  146. [154]

    Gemander, Patrick and Chen, Wei Kun and Weninger, Dieter and Gottwald, Leona and Gleixner, Ambros and Martin, Alexander , file =

  147. [155]

    Proceedings of the VLDB Endowment , keywords =

    Kayali, Moe and Suciu, Dan , doi =. Proceedings of the VLDB Endowment , keywords =

  148. [156]

    Management Science , month =

    Zionts, Stanley , doi =. Management Science , month =

  149. [157]

    and SuhlUwe and H

    Leena and M. and SuhlUwe and H. and Suhl , journal =

  150. [158]

    Operations Research Letters , keywords =

    Zhang, Houshan and Yuan, Jianhua , doi =. Operations Research Letters , keywords =

  151. [159]

    Bixby, Robert E. , doi =

  152. [160]

    and Ye, Yinyu , doi =

    Andersen, Erling D. and Ye, Yinyu , doi =. Management Science , keywords =

  153. [161]

    Ma, Zhichao and Kim, Youngdae and Linderoth, Jeff and Luedtke, James R and Matthews, Logan R , eprint =

  154. [162]

    Maher and Tobias Fischer and Tristan Gally and Gerald Gamrath and Ambros Gleixner and Robert Lion Gottwald and Gregor Hendel and Thorsten Koch and Marco E

    Stephen J. Maher and Tobias Fischer and Tristan Gally and Gerald Gamrath and Ambros Gleixner and Robert Lion Gottwald and Gregor Hendel and Thorsten Koch and Marco E. L. 2017 , url =

    2017

  155. [163]

    Achterberg, Tobias and Berthold, Timo and Hendel, Gregor , doi =

  156. [164]

    2003 , publisher=

    Counterexamples in Analysis , author=. 2003 , publisher=

    2003

  157. [165]

    2020 , type =

    Samuel Souza Brito , title =. 2020 , type =

    2020

  158. [166]

    2023 , eprint=

    Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning , author=. 2023 , eprint=

    2023

  159. [167]

    Martin, Alexander , doi =

  160. [168]

    Weninger, Dieter , keywords =

  161. [169]

    2021 , publisher=

    Preprocessing and cutting planes with conflict graphs , author=. 2021 , publisher=

    2021

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.