COR 2011 - PDF Preprint Papers

COR 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COR-2011 Paper

click to vote

COR
2011

316views Applied Computing» more COR 2011»

MIP models for connected facility location: A theoretical and computational study

13 years 7 months ago

Download homepage.univie.ac.at

This article comprises the ﬁrst theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...

Stefan Gollowitzer, Ivana Ljubic

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	316	MIP models for connected facility location: A theoretical and computational study	claim
2	300	On the application of graph colouring techniques in round-robin sports scheduling	claim
3	299	A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem	claim
4	291	An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows	claim
5	273	Time-constrained project scheduling with adjacent resources	claim
6	259	Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines	claim
7	251	Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems	claim
8	247	Size-reduction heuristics for the unrelated parallel machines scheduling problem	claim
9	241	A squeaky wheel optimisation methodology for two-dimensional strip packing	claim
10	236	Event-based MILP models for resource-constrained project scheduling problems	claim
11	224	Identifying and exploiting commonalities for the job-shop scheduling problem	claim
12	213	Sampled fictitious play for approximate dynamic programming	claim
13	211	A branch-and-cut algorithm for the partitioning-hub location-routing problem	claim
14	211	A Lagrangian heuristic for satellite range scheduling with resource constraints	claim
15	211	Reduction approaches for robust shortest path problems	claim
16	211	Properties and performance modelling of finite buffer M/G/1/K networks	claim
17	205	An exact approach to the problem of extracting an embedded network matrix	claim
18	195	Faster integer-feasibility in mixed-integer linear programs by branching to force change	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers