A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
A service points location problem with Min-Max distance optimality criterion
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.
A solvable case of the set-partitioning problem
A Survey of some Non-Standard Traveling Salesman Problems
A thermodynamically motivated optimization algorithm: Circular wheel balance optimization
The author investigates a Monte Carlo algorithm for finding suboptimal solutions for a wide clase of complicated optimization problems characterized by a large combinatorial complexity. This algorithm was applied to one specific problem: circular wheel balance optimization. The slow increase of the effort along with the increasing size of the problems and the generality of the method promise that the thermodynamically motivated optimization will become a very universal and effective optimization...
A threshold accepting approach to the open vehicle routing problem
In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an optimal...
A threshold accepting approach to the Open Vehicle Routing problem
In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an...
Aggregation of networks
Algèbre linéaire et cheminement dans un graphe
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 49. An algorithm for solving the machine sequencing problem
Algorithmes polynomiaux pour la recherche d'un chemin optimal dans une scène planifiée
Alguns teoremas sobre a equivalência do problema do caixeiro viajante múltiplo ao problema do caixeiro viajante
ALIO/EURO V conference on combinatorial optimization
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005)
An Algorithm for M Asymmetric Travelling Salesman Problem on a Bandwidth-Limited Graph
An easy proof of the limit in the random assignment problem.
An extension of the MS pivoting rule to capacitated network flow problems
An idempotent algorithm for a class of network-disruption games
A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...