Sciweavers

817 search results - page 11 / 164
» Exact solutions to linear programming problems
Sort
View
124
Voted
SIBGRAPI
2005
IEEE
15 years 8 months ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
125
Voted
DISOPT
2010
138views more  DISOPT 2010»
15 years 2 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
SIAMJO
2002
159views more  SIAMJO 2002»
15 years 2 months ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
COCOA
2008
Springer
15 years 4 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
118
Voted
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
15 years 7 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...