Search
Search Results
-
Kofferraum-Tetris mit der Branch-and-Bound-Methode
Endlich Urlaub! Voller Vorfreude haben Anne und Dirk die letzten Wochen genutzt, um den einwöchigen Urlaub im Familienhotel „Club Las Piranhas“...
-
Kofferraum-Tetris mit der Branch-and-Bound-Methode
Endlich Urlaub! Voller Vorfreude haben Anne und Dirk die letzten Wochen genutzt, um den einwöchigen Urlaub im Familienhotel „Club Las Piranhas“...
-
An introduction to variational quantum algorithms for combinatorial optimization problems
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational...
-
Measures of balance in combinatorial optimization
The concept of balance plays an important role in many combinatorial optimization problems. Yet there exist various ways of expressing balance, and...
-
Solving combinatorial bi-level optimization problems using multiple populations and migration schemes
In many decision making cases, we may have a hierarchical situation between different optimization tasks. For instance, in production scheduling, the...
-
Constructive Methods
This chapter presents methods for constructing solutions. It starts with the branch and bound methods, widely used for the design of exact...
-
Discrete Optimization
When solving optimization problems we typically have to make some discrete decisions because of natural constraints that may restrict decision...
-
Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods. However, when the dimension of the problem gets large,...
-
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
Car mass production commonly involves a moving assembly line that mixes several car models. This requires plenty of material supplies at the line...
-
The hiking tourist problem
Hiking is among the most popular outdoor activities. In this paper, we introduce the hiking tourist problem (HTP) to support hikers in their trip...
-
Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems
The efficient management of complex production systems is a challenge in today’s logistics. In the field of intelligent and sustainable logistics,...
-
Weapon-target assignment problem: exact and approximate solution algorithms
The Weapon-Target Assignment (WTA) problem aims to assign a set of weapons to a number of assets (targets), such that the expected value of survived...
-
One-Shot Learning for MIPs with SOS1 Constraints
Efficient algorithms and solvers are required to provide optimal or near-optimal solutions quickly and enable organizations to react promptly to...
-
General Approaches to Decision-Making
Today, in many different areas, decision-making is required at various management levels—operational, tactical, strategic, etc. The primary purpose...
-
Solution Methods for Supply Chain Scheduling Problems
In this chapter we describe some common elements shared by all scheduling problems, introduce some basic concepts related to computational...
-
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
Rescheduling can help to improve the quality of a schedule with respect to an initially given sequence. In this paper, we consider the possibility of...
-
Advances in the decision-making of set covering models under uncertainty
The Set Covering Problem (SCP) has been an extensively studied NP-hard problem in the field of combinatorial optimization since 1970. Over the past...
-
gym-flp: A Python Package for Training Reinforcement Learning Algorithms on Facility Layout Problems
Reinforcement learning (RL) algorithms have proven to be useful tools for combinatorial optimisation. However, they are still underutilised in...
