Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 197
Volume 197, Number 1, January 2023
- Yurii E. Nesterov
:
Inexact accelerated high-order proximal-point methods. 1-26 - Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
Multicriteria cuts and size-constrained k-cuts in hypergraphs. 27-69 - Yang Zheng, Giovanni Fantuzzi:
Sum-of-squares chordal decomposition of polynomial matrix inequalities. 71-108 - Ryoshun Oba, Shin-ichi Tanigawa:
Characterizing the universal rigidity of generic tensegrities. 109-145 - Mirko Hahn, Sven Leyffer, Sebastian Sager:
Binary optimal control by trust-region steepest descent. 147-190 - Cyrille W. Combettes, Sebastian Pokutta:
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, Samuel Burer:
Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. 281-306 - Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
Box-total dual integrality and edge-connectivity. 307-336 - Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
On the robustness of potential-based flow networks. 337-374 - Damek Davis:
Variance reduction for root-finding problems. 375-410 - Amitabh Basu, Hongyi Jiang:
Two-halfspace closure. 411-426 - Aras Selvi, Dick den Hertog, Wolfram Wiesemann:
A reformulation-linearization technique for optimization over simplices. 427-447
Volume 197, Number 2, February 2023
- Santanu S. Dey, Mohit Singh, David P. Williamson:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021. 449-450 - Jannis Blauth, Vera Traub, Jens Vygen:
Improving the approximation ratio for capacitated vehicle routing. 451-497 - Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-taxi via Double Coverage and time-reverse primal-dual. 499-527 - Siad Daboul, Stephan Held, Jens Vygen:
Approximating the discrete time-cost tradeoff problem with bounded depth. 529-547 - Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano:
On the implementation and strengthening of intersection cuts for QCQPs. 549-586 - Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard:
Lifting convex inequalities for bipartite bilinear programs. 587-619 - Lucas Slot, Monique Laurent:
Sum-of-squares hierarchies for binary polynomial optimization. 621-660 - Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, exactness, and rationality in polynomial optimization. 661-692 - José Verschae, Matías Villagra, Léonard von Niederhäusern:
On the geometry of symmetry breaking inequalities. 693-719 - Yuri Faenza, Xuan Zhang:
Affinely representable lattices, stable matchings, and choice functions. 721-760 - Lukas Graf, Tobias Harks:
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows. 761-792 - Leon Eifler, Ambros M. Gleixner:
A computational status update for exact rational mixed integer programming. 793-812 - Vinícius Loti de Lima, Manuel Iori, Flávio Keidi Miyazawa:
Exact solution of network flow models with strong relaxations. 813-846 - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. 847-875 - Robert Carr, R. Ravi, Neil Simonetti:
A new integer programming formulation of the graphical traveling salesman problem. 877-902 - Daniel Rehfeldt, Thorsten Koch:
Implications, conflicts, and reductions for Steiner trees. 903-966 - Paritosh Garg, 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, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-robust scheduling: sand, bricks, and rocks. 1009-1048 - Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. 1049-1067 - Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A tight approximation algorithm for the cluster vertex deletion problem. 1069-1091 - Karthekeyan Chandrasekaran, Weihang Wang:
Fixed parameter approximation scheme for min-max k-cut. 1093-1144 - Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The double exponential runtime is tight for 2-stage stochastic ILPs. 1145-1172 - Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Computational aspects of relaxation complexity: possibilities and limitations. 1173-1200 - Marcel Celaya, Martin Henk:
Proximity bounds for random integer programs. 1201-1219 - Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari:
On the integrality gap of binary integer programs with Gaussian data. 1221-1263 - Rahul Mazumder, Haoyue Wang:
Linear regression with partially mismatched data: local search with theoretical guarantees. 1265-1303
a service of 
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.
last updated on 2024-06-18 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
