default search action
Mathematical Methods of Operations Research, Volume 100
Volume 100, Number 1, August 2024
- Carlos Henggeler Antunes, Carlos M. Fonseca, Luís Paquete, Michael Stiglmayr:
Special issue on exact and approximation methods for mixed-integer multi-objective optimization. 1-4 - Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen
, Daniel Vanderpooten:
Approximating multiobjective optimization problems: How exact can you be? 5-25 - Stephan Helfrich
Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory. 27-63 - Fritz Bökler
Complexity of the multiobjective minimum weight minimum stretch spanner problem. 65-83 - Julius Bauß
Augmenting bi-objective branch and bound by scalarization-based information. 85-121 - Gülesin Sena Das, Fatma Gzara:
Column generation based solution for bi-objective gate assignment problems. 123-151 - Katrin Teichert, Tobias Seidel, Philipp Süss:
Combining discrete and continuous information for multi-criteria optimization problems. 153-173 - Samira Fallah, Ted K. Ralphs, Natashia L. Boland:
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. 175-220 - Diego Pecin, Ian Herszterg, Tyler A. Perini
A fast and robust algorithm for solving biobjective mixed integer programs. 221-262 - Fritz Bökler
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems. 263-290 - Gabriele Eichfelder
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems. 291-320 - Ina Lammel
An approximation algorithm for multiobjective mixed-integer convex optimization. 321-350 - Kerstin Dächert
A simple, efficient and versatile objective space algorithm for multiobjective integer programming. 351-384 - Gabriele Eichfelder
A test instance generator for multiobjective mixed-integer optimization. 385-410
Volume 100, Number 2, October 2024
- Heinz H. Bauschke, Dayou Mao, Walaa M. Moursi
How to project onto the intersection of a closed affine subspace and a hyperplane. 411-435 - Wenzhao Zhang
Discrete-time stopping games with risk-sensitive discounted cost criterion. 437-466 - Keqin Liu
Low-complexity algorithm for restless bandits with imperfect observations. 467-508 - Andrei Comaneci
Tropical convexity in location problems. 509-534 - Daniel Li Li, Erfang Shan
A new value for communication situations. 535-551 - Wentao Ma, Zhiping Chen
Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets. 553-600
Volume 100, Number 3, December 2024
- Oliver Stein:
Editorial. 601 - Samuli Aalto
Whittle index approach to the multi-class queueing systems with convex holding costs and IHR service times. 603-634 - Simone Göttlich
Inverse demand tracking in transportation networks. 635-668 - Iago Núñez Lugilde, Arantza Estévez-Fernández, Estela Sánchez-Rodríguez:
Priority coalitional games and claims problems. 669-701 - Luca Benvenuti, Alberto De Santis, Marianna De Santis
Designing sustainable diet plans by solving triobjective integer programs. 703-721 - Fernando Roldán
Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions. 723-752 - Luciano Barcellos-Paula
100 volumes of Mathematical Methods of Operations Research: a bibliometric overview. 753-796
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-01-27 20:44 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: