Sciweavers

16596 search results - page 198 / 3320
» Generalized Assignment Problems
Sort
View
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 5 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
ICCSA
2007
Springer
16 years 17 days ago
Solving a Practical Examination Timetabling Problem: A Case Study
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
Masri Ayob, Ariff Md. Ab. Malik, Salwani Abdullah,...
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
15 years 11 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
ENDM
2010
126views more  ENDM 2010»
15 years 6 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva
JCO
2008
117views more  JCO 2008»
15 years 6 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...