Kathrin Klamroth

Math. Methods Oper. Res., August, 2024

Consensus-based optimization for multi-objective problems: a multi-swarm approach.

[BibT_eX]

[DOI]

Claudia Totzeck

J. Glob. Optim., July, 2024

Efficient dominance filtering for unions and Minkowski sums of non-dominated sets.

[BibT_eX]

[DOI]

Bruno Lang

Daniela Scherer dos Santos

Comput. Oper. Res., March, 2024

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization.

[BibT_eX]

[DOI]

CoRR, 2024

Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem.

[BibT_eX]

[DOI]

CoRR, 2024

Solving the Multiobjective Quasi-Clique Problem.

[BibT_eX]

[DOI]

Daniela Scherer dos Santos

Pedro Martins

Luís Paquete

CoRR, 2024

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems.

[BibT_eX]

[DOI]

Pedro Martins

Luís Paquete

CoRR, 2024

SCORE Band Visualizations: Supporting Decision Makers in Comparing High-Dimensional Outcome Vectors in Multiobjective Optimization.

[BibT_eX]

[DOI]

Bhupinder Singh Saini

IEEE Access, 2024

2023

Ordinal optimization through multi-objective reformulation.

[BibT_eX]

[DOI]

Julia Sudhoff

Eur. J. Oper. Res., December, 2023

PINN training using biobjective optimization: The trade-off between data loss and residual loss.

[BibT_eX]

[DOI]

J. Comput. Phys., September, 2023

Multi-objective matroid optimization with ordinal weights.

[BibT_eX]

[DOI]

Julia Sudhoff

Discret. Appl. Math., August, 2023

Theoretical Aspects of Subset Selection in Multi-Objective Optimisation.

[BibT_eX]

[DOI]

Andreia P. Guerreiro

Carlos M. Fonseca

Proceedings of the Many-Criteria Optimization and Decision Analysis: State-of-the-Art, 2023

Constructing Optimal L∞ Star Discrepancy Sets.

[BibT_eX]

[DOI]

CoRR, 2023

On the online path extension problem - Location and routing problems in board games.

[BibT_eX]

[DOI]

Konstantin Kraus

CoRR, 2023

Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems.

[BibT_eX]

[DOI]

CoRR, 2023

Non-convex shape optimization by dissipative Hamiltonian flows.

[BibT_eX]

[DOI]

CoRR, 2023

Ridepooling and public bus services: A comparative case-study.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Event-based MILP models for ridepooling applications.

[BibT_eX]

[DOI]

Daniela Gaul

Eur. J. Oper. Res., 2022

Efficient and sparse neural networks by pruning weights in a multiobjective learning approach.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Branch-and-bound and objective branching with three or more objectives.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Decision space robustness for multi-objective integer linear programming.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2022

2021

Tracing Locally Pareto-Optimal Points by Numerical Integration.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2021

Nonconvex constrained optimization by a filtering branch and bound.

[BibT_eX]

[DOI]

Gabriele Eichfelder

Julia Niebling

J. Glob. Optim., 2021

A local analysis to determine all optimal solutions of p-k-max location problems on networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Biobjective Optimization Problems on Matroids with Binary Costs.

[BibT_eX]

[DOI]

Julia Sudhoff

CoRR, 2021

Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph.

[BibT_eX]

[DOI]

Daniela Gaul

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Introducing multiobjective complex systems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Scalability in Multiobjective Optimization (Dagstuhl Seminar 20031).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2020

Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach.

[BibT_eX]

[DOI]

Malena Reiners

CoRR, 2020

GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions.

[BibT_eX]

[DOI]

Britta Schulze

J. Glob. Optim., 2019

Exact algorithms for handling outliers in center location problems on networks using k-max functions.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Interactive Nonconvex Pareto Navigator for multiobjective optimization.

[BibT_eX]

[DOI]

Markus Hartikainen

Kaisa Miettinen

Eur. J. Oper. Res., 2019

A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs.

[BibT_eX]

[DOI]

Anthony Przybylski

Renaud Lacour

CoRR, 2019

Combining Traveling Salesman and Traveling Repairman Problems: A multi-objective approach based on multiple scenarios.

[BibT_eX]

[DOI]

Stefan Bock

Comput. Oper. Res., 2019

2018

Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Assigning Students to Schools for an Internship.

[BibT_eX]

[DOI]

Simon Görtz

Proceedings of the Operations Research Proceedings 2018, 2018

2017

A unified approach to uncertain optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Efficient computation of the search region in multi-objective optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Bi-dimensional knapsack problems with one soft constraint.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

A box decomposition algorithm to compute the hypervolume indicator.

[BibT_eX]

[DOI]

Renaud Lacour

Carlos M. Fonseca

Comput. Oper. Res., 2017

2015

A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems.

[BibT_eX]

[DOI]

Kerstin Dächert

J. Glob. Optim., 2015

On the representation of the search region in multi-objective optimization.

[BibT_eX]

[DOI]

Renaud Lacour

Daniel Vanderpooten

Eur. J. Oper. Res., 2015

Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

Representation of the non-dominated set in biobjective discrete optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

On the multicriteria allocation problem.

[BibT_eX]

[DOI]

José Rui Figueira

Ann. Oper. Res., 2014

2013

On a biobjective search problem in a line: Formulations and algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions.

[BibT_eX]

[DOI]

Stefan Bock

J. Sched., 2013

Multicriteria 0-1 knapsack problems with k-min objectives.

[BibT_eX]

[DOI]

Aiying Rong

José Rui Figueira

Comput. Oper. Res., 2013

2012

Generalized multiple objective bottleneck problems.

[BibT_eX]

[DOI]

Stefan Ruzika

Oper. Res. Lett., 2012

An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems.

[BibT_eX]

[DOI]

Kerstin Dächert

Comput. Oper. Res., 2012

Discrete and geometric Branch and Bound algorithms for medical image registration.

[BibT_eX]

[DOI]

Frank Pfeuffer

Ann. Oper. Res., 2012

Dynamic programming based algorithms for the discounted {0-1} knapsack problem.

[BibT_eX]

[DOI]

Aiying Rong

José Rui Figueira

Appl. Math. Comput., 2012

Dynamic Programming for a Biobjective Search Problem in a Line.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization.

[BibT_eX]

[DOI]

Stefan Ruzika

J. Optim. Theory Appl., 2011

2010

Pareto navigator for interactive nonlinear multiobjective optimization.

[BibT_eX]

[DOI]

OR Spectr., 2010

Optimizing the number of multigrid cycles in the full multigrid algorithm.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2010

2009

On the Application of the Monge--Kantorovich Problem to Image Registration.

[BibT_eX]

[DOI]

SIAM J. Imaging Sci., 2009

The multi-facility location-allocation problem with polyhedral barriers.

[BibT_eX]

[DOI]

Martin Bischoff

Tina Fleischmann

Comput. Oper. Res., 2009

Discrete Multiobjective Optimization.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Multi-Criterion Optimization, 5th International Conference, 2009

09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round).

[BibT_eX]

[DOI]

Proceedings of the Hybrid and Robust Approaches to Multiobjective Optimization, 18.01., 2009

2008

Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2008

Registration of PE segment contour deformations in digital high-speed videos.

[BibT_eX]

[DOI]

Medical Image Anal., 2008

Integrating Approximation and Interactive Decision Making in Multicriteria Optimization.

[BibT_eX]

[DOI]

Kaisa Miettinen

Oper. Res., 2008

A unified model for Weber problems with continuous and network distances.

[BibT_eX]

[DOI]

Barbara Pfeiffer

Comput. Oper. Res., 2008

New trends in locational analysis.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

A Branch & Bound Algorithm for Medical Image Registration.

[BibT_eX]

[DOI]

Frank Pfeuffer

Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008

2007

Biconvex sets and optimization with biconvex functions: a survey and extensions.

[BibT_eX]

[DOI]

Frank Pfeuffer

Math. Methods Oper. Res., 2007

Constrained optimization using multiple objective programming.

[BibT_eX]

[DOI]

Jørgen Tind

J. Glob. Optim., 2007

An efficient solution method for Weber problems with barriers based on genetic algorithms.

[BibT_eX]

[DOI]

Martin Bischoff

Eur. J. Oper. Res., 2007

2005

The K -Connection Location Problem in a Plane.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

A Wavefront Approach to Center Location Problems with Barriers.

[BibT_eX]

[DOI]

L. Frießs

M. Sprau

Ann. Oper. Res., 2005

Planar Location Problems with Block Distance and Barriers.

[BibT_eX]

[DOI]

Perino M. Dearing

Roy Segars Jr.

Ann. Oper. Res., 2005

2004

Integer Programming Duality in Multiple Objective Programming.

[BibT_eX]

[DOI]

Jørgen Tind

Sibylle Zust

J. Glob. Optim., 2004

Algebraic properties of location problems with one circular barrier.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2004

An MCDM approach to portfolio optimization.

[BibT_eX]

[DOI]

Matthias Ehrgott

Christian Schwehm

Eur. J. Oper. Res., 2004

2003

Unbiased approximation in multicriteria optimization.

[BibT_eX]

[DOI]

Jørgen Tind

Math. Methods Oper. Res., 2003

2002

Introducing oblique norms into multiple criteria programming.

[BibT_eX]

[DOI]

Bernd Schandl

J. Glob. Optim., 2002

A Bi-Objective Median Location ProblemWith a Line Barrier.

[BibT_eX]

[DOI]

Oper. Res., 2002

Single-facility location problems with barriers.

[BibT_eX]

Springer series in operations research, Springer, ISBN: 978-0-387-95498-1, 2002

2001

A time-dependent multiple criteria single-machine scheduling problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

A reduction result for location problems with polyhedral barriers.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

Norm-Based Approximation in Bicriteria Programming.

[BibT_eX]

[DOI]

Bernd Schandl

Comput. Optim. Appl., 2001

2000

Planar Weber location problems with barriers and block norms.

[BibT_eX]

[DOI]

Horst W. Hamacher

Ann. Oper. Res., 2000

Lineare und Netzwerk-Optimierung - ein bilinguales Lehrbuch: a bilingual textbook.

[BibT_eX]

Horst W. Hamacher

Vieweg, ISBN: 978-3-528-03155-8, 2000

1996

Ramsey numbers of K3 versus (p, q)-graphs.

[BibT_eX]