EOR 2010 - PDF Preprint Papers

EOR 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EOR-2010 Paper

click to vote

EOR
2010

219views more EOR 2010»

The Attractive Traveling Salesman Problem

13 years 4 months ago

Download www.cs.uwaterloo.ca

In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...

Günes Erdogan, Jean-François Cordeau, ...

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	219	The Attractive Traveling Salesman Problem	claim
2	178	Facility location problems in the plane based on reverse nearest neighbor queries	claim
3	160	A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs	claim
4	159	An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles	claim
5	149	Adaptive multicut aggregation for two-stage stochastic linear programs with recourse	claim
6	147	Modeling latent sources in call center arrival data	claim
7	145	Robust and data-driven approaches to call centers	claim
8	140	Cutting plane algorithms for 0-1 programming based on cardinality cuts	claim
9	133	A memetic algorithm for graph coloring	claim
10	130	Iterated greedy local search methods for unrelated parallel machine scheduling	claim
11	129	Cyber Swarm Algorithms - Improving particle swarm optimization using adaptive memory strategies	claim
12	125	Efficient estimation of large portfolio loss probabilities in t-copula models	claim
13	120	List pricing versus dynamic pricing: Impact on the revenue risk	claim
14	119	Adaptive Tabu Search for course timetabling	claim
15	118	COOPER-framework: A unified process for non-parametric projects	claim
16	117	Joint demand and capacity management in a restaurant system	claim
17	116	Speeding up continuous GRASP	claim
18	114	Technology choice under several uncertainty sources	claim
19	113	Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations	claim
20	113	Combining integer programming and the randomization method to schedule employees	claim
21	110	Pricing surplus server capacity for mean waiting time sensitive customers	claim
22	110	Online scheduling policies for multiclass call centers with impatient customers	claim
23	110	A hybrid metaheuristic approach to solving the UBQP problem	claim
24	108	Managing new and differentiated remanufactured products	claim
25	107	An optimization-based heuristic for the robotic cell problem	claim
26	104	Cut generation for an integrated employee timetabling and production scheduling problem	claim
27	104	New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs	claim
28	103	Exploiting special structure in semidefinite programming: A survey of theory and applications	claim
29	103	Stochastic dominance and risk measure: A decision-theoretic foundation for VaR and C-VaR	claim
30	102	The Tree of Hubs Location Problem	claim
31	101	Asymptotic revenue equivalence of asymmetric auctions with interdependent values	claim
32	101	Random yield supply chain with a yield dependent secondary market	claim
33	101	A linear implementation of PACMAN	claim
34	99	Mathematical programming models for revenue management under customer choice	claim
35	99	Min sum clustering with penalties	claim
36	99	Repeated newsvendor game with transshipments under dual allocations	claim
37	99	Expected gain-loss pricing and hedging of contingent claims in incomplete markets by linear programming	claim
38	98	Lagrangean duals and exact solution to the capacitated p-center problem	claim
39	97	The selectope for bicooperative games	claim
40	96	The hybrid flow shop scheduling problem	claim
41	94	A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems	claim
42	94	The effect of demand uncertainty in a price-setting newsvendor model	claim
43	94	Determinants of bank efficiency: The case of Brazil	claim
44	94	Queues with slow servers and impatient customers	claim
45	93	Two-stage flexible-choice problems under uncertainty	claim
46	93	Uncertainty and stepwise investment	claim
47	92	A survey of variants and extensions of the resource-constrained project scheduling problem	claim
48	88	Applying relation algebra and RelView to measures in a social network	claim
49	88	Market-based pricing in grids: On strategic manipulation and computational cost	claim
50	88	Monge extensions of cooperation and communication structures	claim
51	88	Mathematical programming approaches for generating p-efficient points	claim
52	87	On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks	claim
53	87	Surrogate constraint normalization for the set covering problem	claim
54	87	Inventory systems with stochastic demand and supply: Properties and approximations	claim
55	86	Optimal asset allocation for aggregated defined benefit pension funds with stochastic interest rates	claim
56	86	A parallel multiple reference point approach for multi-objective optimization	claim
57	84	Worst-case analysis of demand point aggregation for the Euclidean p-median problem	claim
58	84	The selection efficiency of tournaments	claim
59	83	Additive conjoint measurement with ordered categories	claim
60	82	Availability optimization of systems subject to competing risk	claim
61	82	Satisfactory graph partition, variants, and generalizations	claim
62	81	Dynamic pickup and delivery problems	claim
63	81	Analysis and design of sequencing rules for car sequencing	claim
64	80	On multiobjective second order symmetric duality with cone constraints	claim
65	76	A stochastic programming model for scheduling call centers with global Service Level Agreements	claim
66	75	Mining Pareto-optimal modules for delayed product differentiation	claim
67	75	Approximating the Pareto optimal set using a reduced set of objective functions	claim
68	75	A note on "Determining the optimal run time for EPQ model with scrap, rework, and stochastic breakdowns"	claim
69	74	Heuristics and exact methods for number partitioning	claim
70	73	A dynamic rationing policy for continuous-review inventory systems	claim
71	73	A new branch-and-price algorithm for the traveling tournament problem	claim
72	73	Generalized linear fractional programming under interval uncertainty	claim
73	72	Can international environmental cooperation be bought?	claim
74	72	Optimising a general repair kit problem with a service constraint	claim
75	71	Evaluation of credit risk based on firm performance	claim
76	69	The pyramidal capacitated vehicle routing problem	claim
77	64	Optimization of order policies in supply networks	claim
78	63	Topological network design of general, finite, multi-server queueing networks	claim
79	63	On the link between Markovian trees and tree-structured Markov chains	claim
80	63	Operations risk management by optimally planning the qualified workforce capacity	claim
81	63	Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars	claim
82	62	Residual income and value creation: An investigation into the lost-capital paradigm	claim
83	62	On range and response: Dimensions of process flexibility	claim
84	61	The axiomatic approach to three values in games with coalition structure	claim
85	58	Stock interest rate risk and inflation shocks	claim
86	58	Games on fuzzy communication structures with Choquet players	claim
87	56	A hybrid immune multiobjective optimization algorithm	claim
88	56	Hybrid variable neighbourhood approaches to university exam timetabling	claim
89	55	Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms	claim
90	55	A queueing model for general group screening policies and dynamic item arrivals	claim
91	55	A model for dynamic chance constraints in hydro power reservoir management	claim
92	54	Constrained group balancing: Why does it work	claim
93	53	Triple seasonal methods for short-term electricity demand forecasting	claim
94	52	The Shapley value for arbitrary families of coalitions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers