- Yurii E. Nesterov👁 0000-0002-0542-8757
:
Inexact accelerated high-order proximal-point methods. 1-26 - Calvin Beideman👁 0000-0001-8053-662X
, Karthekeyan Chandrasekaran👁 0000-0002-3421-7238
, Chao Xu:
Multicriteria cuts and size-constrained k-cuts in hypergraphs. 27-69 - Yang Zheng👁 0000-0003-1545-231X
, Giovanni Fantuzzi👁 0000-0002-0808-0944
:
Sum-of-squares chordal decomposition of polynomial matrix inequalities. 71-108 - Ryoshun Oba👁 0000-0002-0814-8419
, Shin-ichi Tanigawa:
Characterizing the universal rigidity of generic tensegrities. 109-145 - Mirko Hahn👁 0000-0002-2442-3978
, Sven Leyffer👁 0000-0001-8839-5876
, Sebastian Sager👁 0000-0002-0283-9075
:
Binary optimal control by trust-region steepest descent. 147-190 - Cyrille W. Combettes👁 0000-0003-4113-8869
, Sebastian Pokutta👁 0000-0001-7365-3000
:
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm. 191-214 - Digvijay Boob, Qi Deng, Guanghui Lan:
Stochastic first-order methods for convex and nonconvex functional constrained optimization. 215-279 - Anders Eltved👁 0000-0002-1188-1056
, Samuel Burer:
Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. 281-306 - Michele Barbato👁 0000-0002-8521-896X
, Roland Grappe👁 0000-0002-7093-2175
, Mathieu Lacroix, Emiliano Lancini👁 0000-0002-7416-867X
:
Box-total dual integrality and edge-connectivity. 307-336 - Max Klimm👁 0000-0002-9061-2267
, Marc E. Pfetsch👁 0000-0002-0947-7193
, Rico Raber, Martin Skutella:
On the robustness of potential-based flow networks. 337-374 - Damek Davis👁 0000-0003-2105-4641
:
Variance reduction for root-finding problems. 375-410 - Amitabh Basu👁 0000-0002-1070-2626
, Hongyi Jiang👁 0000-0001-9840-078X
:
Two-halfspace closure. 411-426 - Aras Selvi👁 0000-0001-7019-3635
, Dick den Hertog, Wolfram Wiesemann:
A reformulation-linearization technique for optimization over simplices. 427-447
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021
- Santanu S. Dey, Mohit Singh, David P. Williamson:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021. 449-450 - Jannis Blauth👁 0000-0001-5181-802X
, Vera Traub, Jens Vygen:
Improving the approximation ratio for capacitated vehicle routing. 451-497 - Niv Buchbinder, Christian Coester👁 0000-0003-3744-0977
, Joseph Naor:
Online k-taxi via Double Coverage and time-reverse primal-dual. 499-527 - Siad Daboul, Stephan Held👁 0000-0003-2188-1559
, Jens Vygen:
Approximating the discrete time-cost tradeoff problem with bounded depth. 529-547 - Antonia Chmiela👁 0000-0002-4809-2958
, Gonzalo Muñoz👁 0000-0002-9003-441X
, Felipe Serrano👁 0000-0002-7892-3951
:
On the implementation and strengthening of intersection cuts for QCQPs. 549-586 - Xiaoyi Gu, Santanu S. Dey👁 0000-0003-0294-8287
, Jean-Philippe P. Richard:
Lifting convex inequalities for bipartite bilinear programs. 587-619 - Lucas Slot👁 0000-0003-3790-492X
, Monique Laurent👁 0000-0001-8474-2121
:
Sum-of-squares hierarchies for binary polynomial optimization. 621-660 - Daniel Bienstock, Alberto Del Pia, Robert Hildebrand👁 0000-0002-2730-0084
:
Complexity, exactness, and rationality in polynomial optimization. 661-692 - José Verschae👁 0000-0002-2049-6467
, Matías Villagra, Léonard von Niederhäusern:
On the geometry of symmetry breaking inequalities. 693-719 - Yuri Faenza, Xuan Zhang👁 0000-0002-6535-5449
:
Affinely representable lattices, stable matchings, and choice functions. 721-760 - Lukas Graf👁 0000-0001-9212-0277
, Tobias Harks:
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows. 761-792 - Leon Eifler👁 0000-0003-0245-9344
, Ambros M. Gleixner👁 0000-0003-0391-5903
:
A computational status update for exact rational mixed integer programming. 793-812 - Vinícius Loti de Lima👁 0000-0002-4805-4468
, Manuel Iori👁 0000-0003-2097-6572
, Flávio Keidi Miyazawa👁 0000-0002-1067-6421
:
Exact solution of network flow models with strong relaxations. 813-846 - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu👁 0000-0002-9289-0914
:
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. 847-875 - Robert Carr, R. Ravi, Neil Simonetti👁 0000-0001-6128-712X
:
A new integer programming formulation of the graphical traveling salesman problem. 877-902 - Daniel Rehfeldt👁 0000-0002-2877-074X
, Thorsten Koch:
Implications, conflicts, and reductions for Steiner trees. 903-966 - Paritosh Garg👁 0000-0002-6306-3389
, Linus Jordan, Ola Svensson:
Semi-streaming algorithms for submodular matroid intersection. 967-990 - Deeparnab Chakrabarty, Maryam Negahbani:
Robust k-center with two types of radii. 991-1007 - Franziska Eberle👁 0000-0001-8636-9711
, Ruben Hoeksma👁 0000-0002-6553-7242
, Nicole Megow👁 0000-0002-3531-7644
, Lukas Nölke👁 0000-0003-0523-0668
, Kevin Schewior👁 0000-0003-2236-0210
, Bertrand Simon👁 0000-0002-2565-1163
:
Speed-robust scheduling: sand, bricks, and rocks. 1009-1048 - Guyslain Naves👁 0000-0001-5460-9995
, F. Bruce Shepherd👁 0000-0003-1972-1396
, Henry Xia:
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. 1049-1067 - Manuel Aprile👁 0000-0002-6805-6903
, Matthew Drescher, Samuel Fiorini, Tony Huynh👁 0000-0002-6908-923X
:
A tight approximation algorithm for the cluster vertex deletion problem. 1069-1091 - Karthekeyan Chandrasekaran, Weihang Wang👁 0000-0002-0628-5532
:
Fixed parameter approximation scheme for min-max k-cut. 1093-1144 - Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota👁 0000-0001-6215-066X
:
The double exponential runtime is tight for 2-stage stochastic ILPs. 1145-1172 - Gennadiy Averkov👁 0000-0003-2245-9958
, Christopher Hojny👁 0000-0002-5324-8996
, Matthias Schymura👁 0000-0001-5156-7953
:
Computational aspects of relaxation complexity: possibilities and limitations. 1173-1200 - Marcel Celaya👁 0000-0003-3480-4835
, Martin Henk:
Proximity bounds for random integer programs. 1201-1219 - Sander Borst👁 0000-0003-4001-6675
, Daniel Dadush👁 0000-0001-5577-5012
, Sophie Huiberts👁 0000-0003-2633-014X
, Samarth Tiwari👁 0000-0001-7987-1519
:
On the integrality gap of binary integer programs with Gaussian data. 1221-1263 - Rahul Mazumder👁 0000-0003-1384-9743
, Haoyue Wang:
Linear regression with partially mismatched data: local search with theoretical guarantees. 1265-1303
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 👁 unpaywall.org
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 👁 web.archive.org
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 👁 crossref.org
, 👁 opencitations.net
, and 👁 semanticscholar.org
to record detail pages.
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from 👁 opencitations.net
and 👁 semanticscholar.org
to record detail pages.
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 👁 openalex.org
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
