Téléversements by Jozef Kratica

Variable Neighborhood Search for solving Bandwidth Coloring Problem

n107p095

A Genetic Algorithm for the Routing and Carrier Selection Problem

An Electromagnetism-Like Approach for Solving the Low Autocorrelation Binary Sequence Problem

Solving the task assignment problem with a variable neighborhood search

STRONG METRIC DIMENSION

The strong metric dimension of some generalized Petersen graphs

A new genetic representation for quadratic assignment problem

A MIXED INTEGER QUADRATIC PROGRAMMING MODEL FOR THE LOW AUTOCORRELATION BINARY SEQUENCE PROBLEM

Phd Jozef Kratica (2000)