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

82views Applied Computing» more COR 2011»

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

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers