Arslan, Ayşe Poss, Michael Silva, Marco

In this paper, we consider a variant of adaptive robust combinatorial optimization problems with cost uncertainty where the decision maker can prepare K solutions and choose the best among them upon knowledge of the true cost vectors. We propose a new exact algorithm for solving these problems when the feasible set of the nominal optimization probl...

Vega, Frank

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was ...

Alès, Zacharie Knippel, Arnaud

The K-partitioning problem consists in partitioning the nodes of a complete graph G = (V, E) with weights on the edges in exactly K clusters such that the sum of the weights of the edges inside the clusters is minimized. For this problem, we propose two node-cluster formulations adapted from the literature on similar problems as well as two edge-re...

Viana, Monique Simplicio Morandin Junior, Orides Contreras, Rodrigo Colnago
Published in
Sensors (Basel, Switzerland)

It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them. The Job Shop Scheduling Problem (JSSP) is one of these problems, and for its solution, techniques based on Genetic Algori...

Bendotti, Pascale Chrétienne, Philippe Fouilhoux, Pierre Pass-Lanneau, Adèle

In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of jobs whose starting times are guaranteed. The problem was proven NP-hard even for budgeted uncertainty. In the present work we design mixed-integer programming (MIP) for...

Liu, Ge Carter, Brandon Bricken, Trenton Jain, Siddhartha Viard, Mathias Carrington, Mary Gifford, David K.
Published in
Cell Systems

HLA haplotype frequencies are used to evaluate and design SARS-CoV-2 peptide vaccines. The methods presented optimize the presentation likelihood of a diverse set of vaccine peptides to maximize vaccine immunogenicity. The proposed SARS-CoV-2 MHC class I vaccine formulations provide 93.21% predicted population coverage with at least five vaccine pe...

Vesselinova, Natalia Steinert, Rebecca Perez-Ramirez, Daniel F. Boman, Magnus

Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer science, such as computational complexity, then needs to be addressed. Relevant developments in machine learning r...

tsung, chen-kun tseng-fung, ho huang, hsuan-yu yang, shu-hui tsou, po-nien tsai, ming-cheng huang, yi-ping

Assembly is the final process of manufacturing, and a good assembly plan reduces the effect of the tolerance generated in the early stages by the tolerance elimination. In the current assembly lines, the assemblers pick up the workpieces and install them together by the assembly instructions. When the workpieces are oversize or undersize, the produ...

dvořák, jan

Moderní automobilové systémy přinášejí řadu technologických výzev pro vývojáře elektronických řídicích systémů. / Modern automotive systems present a number of new technological challenges for developers and researchers in the field of electronic control systems.

soto-mendoza, valeria garcía-calvillo, irma ruiz-y-ruiz, efraín pérez-terrazas, jaime

This paper presents a hybrid grasshopper optimization algorithm using a novel decoder and local search to solve instances of the open vehicle routing problem with capacity and distance constraints. The algorithm&rsquo / s decoder first defines the number of vehicles to be used and then it partitions the clients, assigning them to the available rout...