Search
Search Results
-
Predicting the Empirical Hardness of Metric TSP Instances
In this work, we propose to classify the empirical hardnesshardness of metric Travelling Salesman Problem (TSP) instances by using four features that...
-
A test instance generator for multiobjective mixed-integer optimization
Application problems can often not be solved adequately by numerical algorithms as several difficulties might arise at the same time. When develo**...
-
Discrete Diversity Optimization: Models and Instances
Maximizing diversity currently constitutes an important area in operations research (OR). Given a set of elements, diversity or dispersion problems...
-
Test instances and numerical results
We have implemented Algorithm 7 in MATLAB for p = 2. All tests have been run on an Intel(R) Core (TM) i7-6700K CPU @ 4.00GHz with 32GB RAM (2x...
-
How Train–Test Leakage Affects Zero-Shot Retrieval
Neural retrieval models are often trained on (subsets of) the millions of queries of the MS MARCO/ORCAS datasets and then tested on the 250 Robust04...
-
The Matrix Sequential Probability Ratio Test and Multivariate Ruin Theory
The matrix sequential probability ratio test (MSPRT) is a statistical method to decide which law governs a collection of independent and identically...
-
Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances
This work presents a statistically principled method for estimating the required number of instances in the experimental comparison of multiple...
-
Extremal metrics on the total space of destabilising test configurations
We construct extremal metrics on the total space of certain destabilising test configurations for strictly semistable Kähler manifolds. This produces...
-
On the Benchmark Instances for the Bin Packing Problem with Conflicts
Many authors, mainly in the context of the Bin Packing Problem with Conflicts, used the random graph generator proposed in “Heuristics and lower...
-
Synthesis of Test Sequences with a Given Switching Activity
AbstractThe relevance of using test sequences with a given switching activity is discussed. As a mathematical model for generating the tests, a...
-
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines
In Software Product Lines, it may be difficult or even impossible to test all the products of the family because of the large number of valid feature...
-
A Second-order Cone Relaxation-Based Branch-and-Bound Algorithm for Complex Quadratic Programs on Acyclic Graphs
Complex quadratically constrained quadratic programs (QCQPs) with underlying acyclic graph structures have special interests in some important...
-
A fast and robust algorithm for solving biobjective mixed integer programs
AbstractWe present a fast and robust algorithm for solving biobjective mixed integer linear programs. Two existing methods are studied:
... 
-
Generation techniques for linear programming instances with controllable properties
This paper addresses the problem of generating synthetic test cases for experimentation in linear programming. We propose a method which maps...
-
-
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
The kidney exchange problem (KEP) is an increasingly important healthcare management problem in most European and North American countries which...
-
The rendezvous vehicle routing problem
We consider a novel scheme for same-day delivery with a strong potential to reduce transportation costs. A delivery company has two distinct fleets...
-
-
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
The minimum sum-of-squares clustering problem is a very important problem in data mining and machine learning with very many applications in, e.g.,...
