| Publication | Date of Publication | Type |
|---|
Approximating multiobjective optimization problems: how exact can you be?
Mathematical Methods of Operations Research | 2024-10-09 | Paper |
Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
Mathematical Methods of Operations Research | 2024-10-09 | Paper |
The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
Journal of Optimization Theory and Applications | 2024-10-07 | Paper |
Parametric matroid interdiction
Discrete Optimization | 2024-03-27 | Paper |
Approximating biobjective minimization problems using general ordering cones
Journal of Global Optimization | 2023-06-28 | Paper |
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
Journal of Global Optimization | 2023-06-28 | Paper |
| Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems | 2023-05-24 | Paper |
An approximation algorithm for a general class of multi-parametric optimization problems
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
An approximation algorithm for a general class of parametric optimization problems
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Approximation Methods for Multiobjective Optimization Problems: A Survey
INFORMS Journal on Computing | 2022-06-28 | Paper |
Interdicting facilities in tree networks
Top | 2022-04-04 | Paper |
The power of the weighted sum scalarization for approximating multiobjective optimization problems
Theory of Computing Systems | 2022-02-14 | Paper |
| The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs | 2021-08-30 | Paper |
One-exact approximate Pareto sets
Journal of Global Optimization | 2021-07-07 | Paper |
On the hardness of covering-interdiction problems
Theoretical Computer Science | 2021-06-08 | Paper |
The binary knapsack problem with qualitative levels
European Journal of Operational Research | 2021-06-03 | Paper |
On the \(p\)-hub interdiction problem
Computers & Operations Research | 2021-04-20 | Paper |
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Mathematical Methods of Operations Research | 2020-12-15 | Paper |
| On the Bicriterion Maximum Flow Network Interdiction Problem | 2020-10-06 | Paper |
A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
Journal of Global Optimization | 2020-08-07 | Paper |
| The two player shortest path network interdiction problem | 2020-04-17 | Paper |
| An FPTAS for a general class of parametric optimization problems | 2020-02-24 | Paper |
Shortest paths with ordinal weights
European Journal of Operational Research | 2019-10-15 | Paper |
Introducing multiobjective complex systems
European Journal of Operational Research | 2019-09-18 | Paper |
| On the Universal Near Shortest Simple Paths Problem | 2019-06-12 | Paper |
On a technique for finding running tracks of specific length in a road network
Operations Research Proceedings | 2018-10-09 | Paper |
Shortest paths with shortest detours. A biobjective routing problem
Journal of Optimization Theory and Applications | 2017-10-27 | Paper |
A general approximation method for bicriteria minimization problems
Theoretical Computer Science | 2017-09-13 | Paper |
A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
Journal of Global Optimization | 2017-03-03 | Paper |
Approximation schemes for the parametric knapsack problem
Information Processing Letters | 2017-01-31 | Paper |
Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
Computers & Operations Research | 2016-11-11 | Paper |
Evacuation modeling: a case study on linear and nonlinear network flow models
EURO Journal on Computational Optimization | 2016-11-11 | Paper |
Comments on: ``Static and dynamic source locations in undirected networks
Top | 2015-11-06 | Paper |
MIN-MAX quickest path problems
Networks | 2013-08-06 | Paper |
Evacuation dynamics influenced by spreading hazardous material
Networks and Heterogeneous Media | 2013-03-21 | Paper |
Generalized multiple objective bottleneck problems
Operations Research Letters | 2012-09-18 | Paper |
Committee selection under weight constraints
Mathematical Social Sciences | 2012-09-11 | Paper |
Connectedness of efficient solutions in multiple objective combinatorial optimization
Journal of Optimization Theory and Applications | 2011-11-25 | Paper |
Reliable and restricted quickest path problems
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Quickest cluster flow problems on tree networks
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Earliest arrival flows on series-parallel graphs
Networks | 2011-03-16 | Paper |
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals
Algorithmic Decision Theory | 2009-11-17 | Paper |
A Survey on Multiple Objective Minimum Spanning Tree Problems
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Improved \(\varepsilon\)-constraint method for multiobjective programming
Journal of Optimization Theory and Applications | 2009-04-24 | Paper |
On \(k\)-Max-optimization
Operations Research Letters | 2009-02-23 | Paper |
Finding representative systems for discrete bicriterion optimization problems
Operations Research Letters | 2008-01-21 | Paper |
Algorithms for time-dependent bicriteria shortest path problems
Discrete Optimization | 2008-01-11 | Paper |
An Exact Algorithm for Solving Weight-Constrained Combinatorial Optimization Problems
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Multiple objective minimum cost flow problems: a review
European Journal of Operational Research | 2006-11-15 | Paper |
Approximation methods in multiobjective programming
Journal of Optimization Theory and Applications | 2006-01-13 | Paper |
Detecting local convexity on the pareto surface
Journal of Multi-Criteria Decision Analysis | 2003-04-02 | Paper |
