Sciweavers

691 search results - page 65 / 139
» Genetic Programming Applied to Mixed Integer Programming
Sort
View
131
Voted
ENDM
2010
101views more  ENDM 2010»
15 years 3 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
142
Voted
COR
2007
176views more  COR 2007»
15 years 2 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
SIAMJO
2002
87views more  SIAMJO 2002»
15 years 2 months ago
An Optimization Approach for Radiosurgery Treatment Planning
We outline a new approach for radiosurgery treatment planning, based on solving a series of optimization problems. We consider a specific treatment planning problem for a speciali...
Michael C. Ferris, Jinho Lim, David M. Shepard
113
Voted
JAIR
2010
99views more  JAIR 2010»
15 years 1 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
SAC
2006
ACM
15 years 2 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen