default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming Computation, Volume 15
Volume 15, Number 1, March 2023
- Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs:
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds. 1-51 - Chris Coey, Lea Kapelevich
, Juan Pablo Vielma:
Performance enhancements for a generic conic interior point algorithm. 53-101 - Demetrios V. Papazaharias, Jose L. Walteros:
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations. 103-151 - Saverio Basso, Alberto Ceselli:
A data driven Dantzig-Wolfe decomposition framework. 153-194 - Zhensheng Yu, Xuyu Chen, Xudong Li:
A dynamic programming approach for generalized nearly isotonic optimization. 195-225
Volume 15, Number 2, June 2023
- Matteo Lapucci, Pierluigi Mansueto, Fabio Schoen:
A memetic procedure for global multi-objective optimization. 227-267 - Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
A branch and bound algorithm for robust binary optimization with budget uncertainty. 269-326 - Raghu Bollapragada, Stefan M. Wild:
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization. 327-364 - Bjørnar Luteberget, Giorgio Sartor:
Feasibility Jump: an LP-free Lagrangian MIP heuristic. 365-388 - Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella:
On the generation of metric TSP instances with a large integrality gap by branch-and-cut. 389-416
Volume 15, Number 3, September 2023
- Christian Kanzow, Daniel Steck:
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization. 417-444 - Daniel Rehfeldt, Thorsten Koch, Yuji Shinano:
Faster exact solution of sparse MaxCut and QUBO problems. 445-470 - Yangyang Xu, Yibo Xu, Yonggui Yan, Colin Sutcher-Shepard, Leopold Grinberg, Jie Chen:
Parallel and distributed asynchronous adaptive stochastic gradient methods. 471-508 - Stephen J. Maher, Elina Rönnberg:
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems. 509-548 - Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Efficient MIP techniques for computing the relaxation complexity. 549-580 - Miles Lubin, Oscar Dowson, Joaquim Dias Garcia, Joey Huchette, Benoît Legat, Juan Pablo Vielma:
JuMP 1.0: recent improvements to a modeling language for mathematical optimization. 581-589
Volume 15, Number 4, December 2023
- Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, Jean-Paul Watson, David L. Woodruff:
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty. 591-619 - Nathaniel Bowman, Michael T. Heath:
Computing minimum-volume enclosing ellipsoids. 621-650 - Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
A hierarchy of spectral relaxations for polynomial optimization. 651-701 - Ksenia Bestuzheva, Ambros M. Gleixner, Stefan Vigerske:
A computational study of perspective cuts. 703-731 - Yasmine Beck, Ivana Ljubic, Martin Schmidt:
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem. 733-782
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 2025-02-20 19:42 CET 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:
