Research Output 1988 2019

Filter
Article
2019

A selfish allocation heuristic in scheduling: Equilibrium and inefficiency bound analysis

Braat, J., Hamers, H., Klijn, F. & Slikker, M., Mar 2019, In : European Journal of Operational Research. 273, 2, p. 634-645

Research output: Contribution to journalArticleScientificpeer-review

Scheduling
Heuristics
Costs
Decision problem
Nash Equilibrium
7 Downloads (Pure)

Distributionally robust optimization with polynomial densities: theory, models and algorithms

de Klerk, E., Kuhn, D. & Postek, K., 2019, In : Mathematical Programming . 32 p.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

New bounds for truthful scheduling on two unrelated selfish machines

Kuryatnikova, O. & Vera, J. C., May 2019, In : Theory of Computing Systems.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Scheduling
Distribution functions
Rational functions

Optimal combined proton-photon therapy schemes based on the standard BED model

ten Eikelder, S. C. M., den Hertog, D., Bortfeld, T. & Perko, Z., Mar 2019, In : Physics in Medicine and Biology. 64, 6, 21 p., 065011.

Research output: Contribution to journalArticleScientificpeer-review

15 Downloads (Pure)

Polynomial norms

Ahmadi, A., de Klerk, E. & Hall, G., 2019, In : SIAM Journal on Optimization. 29, 1, p. 399–422

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Polynomials
Norm
Polynomial
Positive definite
Sum of squares

Reducing conservatism in robust optimization

Roos, E. & den Hertog, D., Jun 2019, (Accepted/In press) In : INFORMS Journal on Computing.

Research output: Contribution to journalArticleScientificpeer-review

Uncertainty
Conservatism
Robust optimization
Violations
Safeguards

Resource allocation problems with concave reward functions

Grundel, S., Borm, P. & Hamers, H., Apr 2019, In : Top . 27, 1, p. 37-54

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Reward
Resource Allocation
Resource allocation
Nucleolus
Resources

Robust optimization of dose-volume metrics for prostate HDR-brachytherapy incorporating target- and OAR volume delineation uncertainties

Balvert, M., den Hertog, D. & Hoffmann, A. L., Feb 2019, In : INFORMS Journal on Computing. 31, 1, p. 100-114

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Radiotherapy
Planning
Tumors
Uncertainty
Robust optimization
2018

Adjustable robust optimization via Fourier-Motzkin elimination

Zhen, J., den Hertog, D. & Sim, M., Jul 2018, In : Operations Research. 66, 4, p. 1086-1100

Research output: Contribution to journalArticleScientificpeer-review

Linear programming
Robust optimization
Optimization problem
Lenses
Decision rules

A new approximation method for the Shapley value applied to the WTC 9/11 terrorist attack

van Campen, T., Hamers, H., Husslage, B. & Lindelauf, R., Dec 2018, In : Social Network Analysis and Mining. 8, 1, 12 p., 3.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
118 Downloads (Pure)

A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem

Marandi, A., Dahl, J. & de Klerk, E., Jun 2018, In : Annals of Operations Research. 265, 1, p. 67-92

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Evaluation
Pooling
Lower bounds
Optimization problem
Programming

Bankruptcy games with nontransferable utility

Dietzenbacher, B., Mar 2018, In : Mathematical Social Sciences. 92, p. 16-21

Research output: Contribution to journalArticleScientificpeer-review

Bankruptcy
bankruptcy
Game
NTU Games
compromise

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization

Gribling, S., de Laat, D. & Laurent, M., Jul 2018, In : Mathematical Programming . 170, 1, p. 5-42

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Quantum Graphs
Entanglement
Polynomials
Polynomial
Optimization
76 Downloads (Pure)

Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing

de Klerk, E. & Laurent, M., Nov 2018, In : Mathematics of Operations Research. 43, 4, p. 1317-1325

Research output: Contribution to journalArticleScientificpeer-review

File
Simulated annealing
Simulated Annealing
Polynomials
Polynomial
Optimization

Computing near-optimal Value-at-Risk portfolios using integer programming techniques

Babat, O., Vera, J. C. & Zuluaga, L. F., 1 Apr 2018, In : European Journal of Operational Research. 266, 1, p. 304-315

Research output: Contribution to journalArticleScientificpeer-review

Value at Risk
Integer programming
Integer Programming
Reward
Computing

Computing the maximum volume inscribed ellipsoid of a polytopic projection

Zhen, J. & den Hertog, D., Jan 2018, In : INFORMS Journal on Computing. 30, 1, p. 31-42

Research output: Contribution to journalArticleScientificpeer-review

Color
Approximation
Optimization techniques
Optimal solution
Robust optimization

Debt stabilization in the presence of risk premia: A dynamic game approach

Anevlavis, T., Papavassilopoulos, G., Engwerda, J. & van Aarle, B., Jan 2018, In : Macroeconomic Dynamics.

Research output: Contribution to journalArticleScientificpeer-review

Debt
Dynamic games
Stabilization
Risk premia
Risk premium

Deciding robust feasibility and infeasibility using a set containment approach: An application to stationary passive gas network operations

Aßmann, D., Liers, F., Stingl, M. & Vera, J. C., Sep 2018, In : SIAM Journal on Optimization. 28, 3, p. 2489-2517

Research output: Contribution to journalArticleScientificpeer-review

Infeasibility
Polynomials
Polynomial
Gases
Absolute value

Directed strongly walk-regular graphs

van Dam, E. & Omidi, G. R., 1 Jun 2018, In : Journal of Algebraic Combinatorics. 47, 4, p. 623–639

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Regular Graph
Walk
Digraph
Eigenvalue
Adjacency Matrix

Effects of debt mutualization in a monetary union with endogenous risk premia: Can Eurobonds contribute to debt stabilization?

van Aarle, B., Engwerda, J. & Weeren, A. J. T. M., Mar 2018, In : Structural Change and Economic Dynamics. 44, p. 100-114

Research output: Contribution to journalArticleScientificpeer-review

Eurobonds
Debt
Endogenous risk
Stabilization
Monetary union

Extended antipodal theorems

Kalashnikov, V. V., Talman, D., Alanis-Lopez, L. & Kalashnykova, N. I., May 2018, In : Journal of Optimization Theory and Applications. 177, 2, p. 399-412

Research output: Contribution to journalArticleScientificpeer-review

Triangulation
Star-shaped Set
Stars
Optimization Theory
Fixed point

Globally solving non-convex quadratic programs via linear integer programming techniques

Xia, W., Vera, J. C. & Zuluaga, L. F., Nov 2018, (Accepted/In press) In : INFORMS Journal on Computing. 22 p.

Research output: Contribution to journalArticleScientificpeer-review

Quadratic programming
Integer programming
Nonlinear programming
Integer linear programming
MATLAB

Graph bisection revisited

Sotirov, R., Jun 2018, In : Annals of Operations Research. 265, 1, p. 143-154

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Graph
Semidefinite programming
Valid inequalities
Partitioning

Hysteresis due to irreversible exit: Addressing the option to mothball

Guerra, M., Kort, P., Nunes, C. & Oliveira, C., Jul 2018, In : Journal of Economic Dynamics & Control. 92, p. 69-83

Research output: Contribution to journalArticleScientificpeer-review

Laplacian spectral characterization of roses

He, C. & van Dam, E., 1 Jan 2018, In : Linear Algebra and its Applications. 536, p. 19-30

Research output: Contribution to journalArticleScientificpeer-review

Graph in graph theory
Laplacian Spectrum
Laplacian Matrix
Adjacency Matrix
Disjoint

On analyzing cost allocation problems: Cooperation building structures and order problem representations

Kleppe, J., Borm, P., Hendrickx, R. & Reijnierse, H., 2018, In : International Game Theory Review. 20, 1850007.

Research output: Contribution to journalArticleScientificpeer-review

Cost Allocation
Costs
Cost functions
Traveling salesman problem
Cost Function

On solving the quadratic shortest path problem

Hu, H. & Sotirov, R., 2018, (Accepted/In press) In : INFORMS Journal on Computing.

Research output: Contribution to journalArticleScientificpeer-review

Directed graphs
Costs
Shortest path
Semidefinite programming
Multiplier

On the convexity of step out - Step in sequencing games

Musegaas, M., Borm, P. & Quant, M., Apr 2018, In : Top . 26, 1, p. 68-109

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Sequencing
Convexity
Game
Coalitions
Processing

Partially metric association schemes with a multiplicity three

van Dam, E., Koolen, J. H. & Park, J., 1 May 2018, In : Journal of Combinatorial Theory, Series B, Graph theory. 130, p. 19-48

Research output: Contribution to journalArticleScientificpeer-review

Association Scheme
Multiplicity
Metric
Graph in graph theory
Arc of a curve

Robust optimization with ambiguous stochastic constraints under mean and dispersion information

Postek, K., Ben-Tal, A., den Hertog, D. & Melenberg, B., May 2018, In : Operations Research. 66, 3, p. 814-833

Research output: Contribution to journalArticleScientificpeer-review

Random variables
Computational complexity
Robust optimization
Upper bound

Serious strategy for the makers of fun: Analyzing the option to switch from pay-to-play to free-to-play in a two-stage optimal control model with quadratic costs

Seidl, A., Caulkins, J. P., Hartl, R. F. & Kort, P., Jun 2018, In : European Journal of Operational Research. 267, 2, p. 700-715

Research output: Contribution to journalArticleScientificpeer-review

Switch
Optimal Control
Video Games
Business Model
Switches

Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy

de Klerk, E., Marandi, A. & Dahl, J., 2018, In : Discrete Applied Mathematics.

Research output: Contribution to journalArticleScientificpeer-review

Sparse Polynomials
Degree Sum
Sum of squares
Polynomials
Optimization Problem

Special cases of the quadratic shortest path problem

Sotirov, R. & Hu, H., Apr 2018, In : Journal of Combinatorial Optimization. 35, 3, p. 754-777

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Shortest Path Problem
Costs
Digraph
Polynomials
Path

Stabilization of an uncertain simple fishery management game

Engwerda, J., Jul 2018, In : Fisheries Research. 203, p. 63-73

Research output: Contribution to journalArticleScientificpeer-review

fishery management
stabilization
active control
valuation
fish

The min-cut and vertex separator problem

Rendl, F. & Sotirov, R., Jan 2018, In : Computational Optimization and Applications. 69, 1, p. 159-187

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Min-cut
Separator
Separators
Quadratic programming
Graph in graph theory

Three-valued simple games

Musegaas, M., Borm, P. E. M. & Quant, M., Aug 2018, In : Theory and Decision. 85, 2, p. 201-224

Research output: Contribution to journalArticleScientificpeer-review

Open Access

When are static and adjustable robust optimization with constraint-wise uncertainty equivalent?

Marandi, A. & den Hertog, D., Aug 2018, In : Mathematical Programming . 170, 2, p. 555-568

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Robust Optimization
Uncertainty
Uncertain Parameters
Decision Rules
Optimization Problem
15 Downloads (Pure)

Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube

de Klerk, E. & Laurent, M., 2018, (Accepted/In press) In : Mathematics of Operations Research.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Hypercube
Polynomials
Polynomial
Optimization
Convergence Rate
2017

Adjustable robust optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty

Buhayenko, V. & den Hertog, D., Jul 2017, In : International Journal of Production Research. 55, 22, p. 6801-6823

Research output: Contribution to journalArticleScientificpeer-review

Supply chains
Uncertainty
Demand uncertainty
Robust optimization
Supply chain coordination

A heuristic for real-time crew rescheduling during small disruptions

Verhaegh, T., Huisman, D., Fioole, P-J. & Vera Lizcano, J. C., Jul 2017, In : Public Transport. 9, 1, p. 325-342

Research output: Contribution to journalArticleScientificpeer-review

German Federal Railways
heuristics
time management
Netherlands
time

A Lex-BFS-based recognition algorithm for Robinsonian matrices

Laurent, M. & Seminaroti, M., May 2017, In : Discrete Applied Mathematics. 222, p. 151-165

Research output: Contribution to journalArticleScientificpeer-review

Breadth-first Search
Recognition Algorithm
Seriation
Interval Graphs
Divide and conquer
187 Downloads (Pure)

A numerical algorithm to calculate the unique feedback nash equilibrium in a large scalar LQ differential game

Engwerda, J., Dec 2017, In : Dynamic Games and Applications. 7, 4, p. 635-656

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Differential Games
Nash Equilibrium
Numerical Algorithms
Scalar
Feedback

Approximating the cone of copositive kernels to estimate the stability number of infinite graphs

Kuryatnikova, O. & Vera Lizcano, J., Nov 2017, In : Electronic Notes in Discrete Mathematics. 62, p. 303-308

Research output: Contribution to journalArticleScientificpeer-review

Stability number
Infinite Graphs
Cone
kernel
Estimate
41 Downloads (Pure)

A structural characterization for certifying robinsonian matrices

Laurent, M., Seminaroti, M. & Tanigawa, S., 5 May 2017, In : The Electronic Journal of Combinatorics: EJC. 24, 2, p. 1-22 22 p., P2.21.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Interval Graphs
Unit
Adjacency Matrix
Weighted Graph
Substructure

Bound-constrained polynomial optimization using only elementary calculations

de Klerk, E., Lasserre, J. B., Laurent, M. & Sun, Z., Aug 2017, In : Mathematics of Operations Research. 42, 3, p. 834-853

Research output: Contribution to journalArticleScientificpeer-review

Hypercube
Polynomials
Polynomial
Optimization
Rate of Convergence
45 Downloads (Pure)

Centered solutions for uncertain linear equations

Zhen, J. & den Hertog, D., Oct 2017, In : Computational Management Science. 14, 4, p. 585-610

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Linear equations
Uncertainty
Robust optimization

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization

de Klerk, E., Laurent, M. & Sun, Z., Mar 2017, In : Mathematical Programming . 162, 1, p. 363-392

Research output: Contribution to journalArticleScientificpeer-review

Convergence Analysis
Compact Set
Probability density function
Polynomials
Upper bound

Cooperative games with restricted formation of coalitions

Koshevoy, G., Suzuki, T. & Talman, D., Feb 2017, In : Discrete Applied Mathematics. 218, p. 1-13 218.

Research output: Contribution to journalArticleScientificpeer-review

Cooperative Game
Coalitions
Choice Function
Set Systems
Game

Cost allocation for elastic single-attribute situations

Karsten, F., Slikker, M. & Borm, P., Jun 2017, In : Naval Research Logistics. 64, 4, p. 271-286

Research output: Contribution to journalArticleScientificpeer-review

Cost Allocation
Attribute
Costs
Rationality
Fairness
168 Downloads (Pure)

Decomposition of network communication games

Dietzenbacher, B., Borm, P. & Hendrickx, R., Jun 2017, In : Mathematical Methods of Operations Research. 85, 3, p. 407-423

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Network Communication
Telecommunication networks
Game
Decomposition
Decompose