Search academic resources

This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network...

Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objecti...

Metaheuristics Algorithms are widely recognized as one of most practical approaches for Combinatorial Optimization Problems. This paper presents a comparison between two metaheuristics to solve a problem of Phase Bal...

FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices....

The article describes the proposition and implementation of a demonstration, learning and decision support system for the resolution of combinatorial optimization problems under multiple objectives. The system brings tog...

Ising machines are novel computing devices for the energy minimization of Ising models. These combinatorial optimization problems are of paramount importance for science and technology, but remain difficult to tackle on ...

El problema de programación flexible del taller de trabajos (FJSSP) es uno de los problemas de optimización combinatoria más desafiantes, con aplicabilidad práctica en un entorno de producción real. En este trabajo,...

There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (fi...

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. ...

The Estimation Distribution Algorithms (EDAs) compose an evolutionary metaheuristic whose main characteristic is the construction of solutions in randomly form, using a distribution of probabilities that evolves during t...

Historically Functional Programming FP for short has been associated with a small scope of applications mainly academic The computer science community did not pay enough attention to its potential perhaps due t...

Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose...

The Ant Colony Optimization (ACO) metaheuristic is a bio-inspired approach for hard combinatorial optimization problems for stationary and non-stationary environments. In the ACO metaheuristic, a colony of artificial ant...

A new issue for combinatorial optimization problems is to incorporate local search into the framework of evolutionary algorithms, leading to hybrid evolutionary algorithms. With the hybrid approach, evolutionary algorith...

La técnica Optimización de Colonias de Hormigas (ACO) puede ser aplicada a problemas de optimización combinatorios duros en ambientes estacionarios y no estacionarios. En dicha metaheurística, las hormigas artificial...

The choice of a search algorithm can play a vital role in the success of a scheduling application. Evolutionary algorithms (EAs) can be used to solve this kind of combinatorial optimization problems. Compared to conventi...

"En el Capítulo 1 de este trabajo se da una breve introducción a la importancia rol que cumple la optimización de procesos y la investigación de operaciones así como también los diferentes métodos de soluciones es...

The portfolio optimization problem is a mathematical and financial decision-making method that aims to achieve an optimal trade-off between financial risk and return. This paper presents the first application of the nove...

In recent years, there has been a growing interest in optical simulation of lattice spin models for applications in unconventional computing. Here, we propose optical implementation of a three-state Potts spin model by u...

El presente trabajo trata la problemática que se presenta, cuando al inicio de cada ciclo lectivo, una institución educativa realiza las asignación de sus recursos disponibles (docentes, aulas, asignaturas, etc…), t...

This review is an updated and expanded version of two prior reviews that were published in this journal in 1997 and 2003. In the case of all approved agents the time frame has been extended to include the 251/2 years fro...

This review is an updated and expanded version of the five prior reviews that were published in this journal in 1997, 2003, 2007, 2012, and 2016. For all approved therapeutic agents, the time frame has been extended to c...

Abstract The computation of optimal routes considering multiple factors is a key challenge in operations research, with significant impact on practical decision-making and real-world efficiency. Optimal bus transit route...