COR 2007 - PDF Preprint Papers

COR 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COR-2007 Paper

click to vote

COR
2007

213views more COR 2007»

Retail-collection network design under deposit-refund

13 years 4 months ago

Download people.mcgill.ca

Rico Wojanowski, Vedat Verter, Tamer Boyaci

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	213	Retail-collection network design under deposit-refund	claim
2	183	Arcs-states models for the vehicle routing problem with time windows and related problems	claim
3	176	Scheduling and routing of automated guided vehicles: A hybrid approach	claim
4	163	A general heuristic for vehicle routing problems	claim
5	157	A decision support system for the single-depot vehicle rescheduling problem	claim
6	143	A memetic algorithm for channel assignment in wireless FDMA systems	claim
7	143	Discrete bandwidth allocation considering fairness and transmission load in multicast networks	claim
8	139	Computer assisted customer churn management: State-of-the-art and future trends	claim
9	134	Portfolio selection using neural networks	claim
10	133	Reverse logistics network design with stochastic lead times	claim
11	130	Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery	claim
12	121	An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint	claim
13	112	The bi-objective covering tour problem	claim
14	109	Assessing performance and uncertainty in developing carpet reverse logistics systems	claim
15	108	New primal-dual algorithms for Steiner tree problems	claim
16	108	A hub location problem with fully interconnected backbone and access networks	claim
17	106	Scheduling parallel CNC machines with time/cost trade-off considerations	claim
18	106	On a stochastic sequencing and scheduling problem	claim
19	105	Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems	claim
20	103	A reactive GRASP and path relinking for a combined production-distribution problem	claim
21	99	An improved algorithm for the p-center problem on interval graphs with unit lengths	claim
22	99	Multicriteria decision model for outsourcing contracts selection based on utility function and ELECTRE method	claim
23	97	Two-stage general block patterns for the two-dimensional cutting problem	claim
24	95	Inventory routing with continuous moves	claim
25	90	Analysis of bounds for a capacitated single-item lot-sizing problem	claim
26	88	Finding minimum and equitable risk routes for hazmat shipments	claim
27	87	An exact algorithm for generating homogenous T-shape cutting patterns	claim
28	86	An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria	claim
29	86	Sourcing with random yields and stochastic demand: A newsvendor approach	claim
30	83	The impact of US tax depreciation law on asset location and ownership decisions	claim
31	81	Job scheduling methods for reducing waiting time variance	claim
32	80	A heuristic approach to simultaneous course/student timetabling	claim
33	80	Scheduling with tool changes to minimize total completion time under controllable machining conditions	claim
34	80	A MAX-MIN ant system for unconstrained multi-level lot-sizing problems	claim
35	79	Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem	claim
36	71	Using lexicographic parametric programming for identifying efficient units in DEA	claim
37	71	Considering scheduling and preventive maintenance in the flowshop sequencing problem	claim
38	70	Markov chain models of a telephone call center with call blending	claim
39	69	On separating cover inequalities for the multidimensional knapsack problem	claim
40	69	Optimizing the design of railway tank cars to minimize accident-caused releases	claim
41	60	Single-machine scheduling with periodic maintenance to minimize makespan	claim
42	59	Creating a consensus ranking of proposals from reviewers' partial ordinal rankings	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers