COLOGNETWENTE 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COLOGNETWENTE-2008 Paper

click to vote

COLOGNETWENTE
2008

174views Optimization» more COLOGNETWENTE 2008»

A dynamic service mechanic problem for a housing corporation

13 years 6 months ago

Download dissertations.ub.rug.nl

Maria L. A. G. Cremers, Joaquim A. S. Gromicho, Wi...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	174	A dynamic service mechanic problem for a housing corporation	claim
2	123	Dynamic Programming for Optimization of Capacitor Allocation in Power Distribution Networks	claim
3	120	Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem	claim
4	114	Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy	claim
5	106	A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem	claim
6	102	A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs	claim
7	94	Classbased Detailed Routing in VLSI Design	claim
8	90	Reformulations in Mathematical Programming: Definitions	claim
9	90	A local approximation algorithm for maximum weight matching	claim
10	89	On co-distance hereditary graphs	claim
11	87	A decomposition for total-coloring graphs of maximum degree 3	claim
12	86	Bidirectional A* on Time-dependent Graphs	claim
13	86	Special Cases of Online Parallel Job Scheduling	claim
14	85	Approximating (r, p)-Centroid on a Path	claim
15	82	On the Facial Structure of the Common Edge Subgraph polytope	claim
16	81	Decomposing trees with large diameter	claim
17	81	On the cardinality constrained matroid polytope	claim
18	79	On the Bi-enhancement of Chordal-bipartite Probe Graphs	claim
19	78	Edge fault-diameter of Cartesian graph bundles	claim
20	77	A Simple 3-Approximation of Minimum Manhattan Networks	claim
21	77	Exact Algorithms for the Vertex Separator Problem in Graphs	claim
22	73	The Uncapacitated Swapping Problem	claim
23	73	Percolation on sparse random graphs with given degree sequence	claim
24	66	On minimum reload cost paths, tours and flows	claim
25	65	Global r-alliances and total domination	claim
26	63	Inverse Tension Problems	claim
27	59	Exact Graph Coloring via Hybrid Approaches	claim
28	55	Locating Median Paths on Connected Outerplanar Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers