This dataset is an optimality benchmark for 1 synthetic 3 real-world application scenarios:1. A synthetic dataset2. Residential energy consumption3. Bike sharing4. Charging control of electric vehiclesThe dataset consists of 1 million random network positioning of agents in a binary tree, which are used in the collective learning algorithm of I-EPOS to explore the learning capacity of the combinatorial landscape. This dataset can be used as reference of other heuristic algorithms and enhancements. Besides random positioning, the dataset comes with 124 metrics that evaluate deterministic criteria for the agents' positioning. </div
Algorithms typically come with tunable parameters that have a considerable impact on the computation...
AbstractOur ability to solve large, important combinatorial optimization problems has improved drama...
This report is a brief exposition of some of the important links between machine learning and combin...
We study dynamic decision making under uncertainty when, at each period, the decision maker faces a ...
To have good data quality with high complexity is often seen to be important. Intuition says that th...
This article presents a critical evaluation of swarm intelligence techniques for solving combinatori...
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to...
A group of young researchers from the ESI X summer school, HEC, Jouy-en-Josas 1994, give their perso...
The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few stud...
Available from British Library Document Supply Centre-DSC:DXN047342 / BLDSC - British Library Docume...
Combinatorial optimization problems are ubiquitous in artificial intelligence. Designing the underly...
Branch-and-bound is a systematic enumerative method for combinatorial optimization, where the perfor...
In the first article we present a network based algorithm for probabilistic inference in an undirect...
In theoretical computer science, combinatorial optimization problems are about finding an optimal it...
Machine learning has recently emerged as a prospective area of investigation for OR in general and s...
Algorithms typically come with tunable parameters that have a considerable impact on the computation...
AbstractOur ability to solve large, important combinatorial optimization problems has improved drama...
This report is a brief exposition of some of the important links between machine learning and combin...
We study dynamic decision making under uncertainty when, at each period, the decision maker faces a ...
To have good data quality with high complexity is often seen to be important. Intuition says that th...
This article presents a critical evaluation of swarm intelligence techniques for solving combinatori...
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to...
A group of young researchers from the ESI X summer school, HEC, Jouy-en-Josas 1994, give their perso...
The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few stud...
Available from British Library Document Supply Centre-DSC:DXN047342 / BLDSC - British Library Docume...
Combinatorial optimization problems are ubiquitous in artificial intelligence. Designing the underly...
Branch-and-bound is a systematic enumerative method for combinatorial optimization, where the perfor...
In the first article we present a network based algorithm for probabilistic inference in an undirect...
In theoretical computer science, combinatorial optimization problems are about finding an optimal it...
Machine learning has recently emerged as a prospective area of investigation for OR in general and s...
Algorithms typically come with tunable parameters that have a considerable impact on the computation...
AbstractOur ability to solve large, important combinatorial optimization problems has improved drama...
This report is a brief exposition of some of the important links between machine learning and combin...