Add to ORKGIn combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorith
In this survey, we give an overview of a technique used to design and analyze algorithms that provi...
International audienceCombinatorial optimization problems serve as models for a great number of real...
The main objective of the polynomial approximation is the development of polynomial time algorithms ...
. In the past few years, there has been significant progress in our understanding of the extent to w...
The computational complexity of combinatorial multiple objective programming problems is investigate...
AbstractA general approximation technique for a large class of NP-hard optimization problems which i...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : DO 4346 / INIST-CNRS - I...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
In a combinatorial optimization problem, when given an input instance, one seeks a feasible solution...
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomia...
An α-approximation algorithm is an algorithm guaranteed to output a solution that is within an α rat...
The computational complexity of combinatorial multiple objective programming problems is investigate...
This paper is a chapter of the forthcoming Handbook of Combinatorics, to be published by North-Holla...
In this survey, we give an overview of a technique used to design and analyze algorithms that provi...
International audienceCombinatorial optimization problems serve as models for a great number of real...
The main objective of the polynomial approximation is the development of polynomial time algorithms ...
. In the past few years, there has been significant progress in our understanding of the extent to w...
The computational complexity of combinatorial multiple objective programming problems is investigate...
AbstractA general approximation technique for a large class of NP-hard optimization problems which i...
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a ...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : DO 4346 / INIST-CNRS - I...
The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the...
Abstract: The fact that polynomial time algorithm is very unlikely to be devised for an optimal solv...
In a combinatorial optimization problem, when given an input instance, one seeks a feasible solution...
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomia...
An α-approximation algorithm is an algorithm guaranteed to output a solution that is within an α rat...
The computational complexity of combinatorial multiple objective programming problems is investigate...
This paper is a chapter of the forthcoming Handbook of Combinatorics, to be published by North-Holla...
In this survey, we give an overview of a technique used to design and analyze algorithms that provi...
International audienceCombinatorial optimization problems serve as models for a great number of real...
The main objective of the polynomial approximation is the development of polynomial time algorithms ...