EOR 2007 - PDF Preprint Papers

EOR 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EOR-2007 Paper

click to vote

EOR
2007

364views more EOR 2007»

Heuristics for the mirrored traveling tournament problem

14 years 7 days ago

Download homepages.dcc.ufmg.br

Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...

Celso C. Ribeiro, Sebastián Urrutia

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	364	Heuristics for the mirrored traveling tournament problem	claim
2	272	A dynamic logistics coordination model for evacuation and support in disaster response activities	claim
3	221	Application of the analytical hierarchy process to establish health care waste management systems that minimise infection risks in developing countries	claim
4	198	Airline crew scheduling from planning to operations	claim
5	174	A Benders approach for the constrained minimum break problem	claim
6	165	Adaptive credit scoring with kernel learning methods	claim
7	163	The multi-depot vehicle routing problem with inter-depot routes	claim
8	159	Solving the semi-desirable facility location problem using bi-objective particle swarm	claim
9	158	A graph-based hyper-heuristic for educational timetabling problems	claim
10	151	A possibilistic decision model for new product supply chain design	claim
11	147	Routing and wavelength assignment in optical networks using bin packing based algorithms	claim
12	133	Using genetic algorithm for dynamic and multiple criteria web-site optimizations	claim
13	128	Value of capacity pooling in supply chains with heterogeneous customers	claim
14	123	A stochastic model for risk management in global supply chain networks	claim
15	123	Dynamic programming analysis of the TV game "Who wants to be a millionaire?"	claim
16	117	Considering manufacturing cost and scheduling performance on a CNC turning machine	claim
17	117	Approximation of min-max and min-max regret versions of some combinatorial optimization problems	claim
18	117	Simultaneous perturbation stochastic approximation of nonsmooth functions	claim
19	113	Duality for location problems with unbounded unit balls	claim
20	111	Linear programming based algorithms for preemptive and non-preemptive RCPSP	claim
21	111	Closed-loop supply chain network equilibrium under legislation	claim
22	111	A pegging approach to the precedence-constrained knapsack problem	claim
23	110	A hierarchical ant based clustering algorithm and its use in three real-world applications	claim
24	110	An improved typology of cutting and packing problems	claim
25	109	Accessibility in oriented networks	claim
26	108	How much information do we need?	claim
27	108	Probability density functions based weights for ordered weighted averaging (OWA) operators: An example of water quality indices	claim
28	108	Measuring retail company performance using credit scoring techniques	claim
29	105	Newton's method and its use in optimization	claim
30	104	Analysis of the constraint proposal method for two-party negotiations	claim
31	104	Optimal resource allocation for security in reliability systems	claim
32	104	A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem	claim
33	103	Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness	claim
34	103	Alternative configurations for cutting machines in a tube cutting mill	claim
35	102	Bucket brigades with worker learning	claim
36	102	Sub-stochastic matrix analysis for bounds computation - Theoretical results	claim
37	101	Using aggregation to optimize long-term production planning at an underground mine	claim
38	101	Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms	claim
39	101	Optimizing an objective function under a bivariate probability model	claim
40	101	Comprehensible credit scoring models using rule extraction from support vector machines	claim
41	100	Designing delivery districts for the vehicle routing problem with stochastic demands	claim
42	100	Parallel radial basis function methods for the global optimization of expensive functions	claim
43	99	Resource enablement modeling: Implications for studying the diffusion of technology	claim
44	99	Computing the asymptotic worst-case of bin packing lower bounds	claim
45	99	Learning lexicographic orders	claim
46	98	Location of terror response facilities: A game between state and terrorist	claim
47	97	Using pattern matching for tiling and packing problems	claim
48	96	A balancing method and genetic algorithm for disassembly line balancing	claim
49	96	A fast method for discovering critical edge sequences in e-commerce catalogs	claim
50	95	A hybrid genetic algorithm for the two-dimensional single large object placement problem	claim
51	93	Location-routing: Issues, models and methods	claim
52	93	Exact algorithms for procurement problems under a total quantity discount structure	claim
53	93	An integrated approach for deriving priorities in analytic network process	claim
54	93	Contour line construction for a new rectangular facility in an existing layout with rectangular departments	claim
55	92	Planning and approximation models for delivery route based services with price-sensitive demands	claim
56	92	Modelling profitability using survival combination scores	claim
57	90	Tabu search and GRASP for the maximum diversity problem	claim
58	90	Arc routing problems with time-dependent service costs	claim
59	90	Further results on concordance relations	claim
60	90	Accelerating column generation for variable sized bin-packing problems	claim
61	90	Structural models in consumer credit	claim
62	89	The service allocation problem at the Gioia Tauro Maritime Terminal	claim
63	89	Trade reduction vs. multi-stage: A comparison of double auction design approaches	claim
64	89	Note: An application of the EOQ model with nonlinear holding cost to inventory management of perishables	claim
65	89	Managing a portfolio of long term service agreements	claim
66	88	Designing man-machine interactions for mobile clinical systems: MET triage support using Palm handhelds	claim
67	88	The stochastic location model with risk pooling	claim
68	88	The minimum size instance of a Pallet Loading Problem equivalence class	claim
69	88	The geometry and number of the root invariant regions for linear systems	claim
70	88	To ask or not to ask, that is the question	claim
71	87	The TV-Break Packing Problem	claim
72	87	An optimal and scalable parallelization of the two-list	claim
73	87	Modeling gene regulatory networks with piecewise linear differential equations	claim
74	86	The affect heuristic	claim
75	86	Multiple dependent state sampling plans for lot acceptance based on measurement data	claim
76	85	Modeling and analysis of a supply-assembly-store chain	claim
77	85	Machine reliability and preventive maintenance planning for cellular manufacturing systems	claim
78	85	Reject inference, augmentation, and sample selection	claim
79	84	The multi-layered network design problem	claim
80	82	Minimizing makespan with multiple-orders-per-job in a two-machine flowshop	claim
81	82	The equitable location problem on the plane	claim
82	81	A note on the approximability of cutting stock problems	claim
83	80	A partition approach to the inventory/routing problem	claim
84	80	Exploiting nested inequalities and surrogate constraints	claim
85	80	Coherent risk measures in inventory problems	claim
86	80	The tool switching problem revisited	claim
87	79	Optimal preemptive scheduling on uniform machines with discounted flowtime objectives	claim
88	79	Consensus reaching in committees	claim
89	79	The directional p	claim
90	78	Heuristic modeling of expectation formation in a complex experimental information environment	claim
91	78	A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem	claim
92	78	A heuristic for the three-dimensional strip packing problem	claim
93	77	A review of congestion models in the location of facilities with immobile servers	claim
94	77	Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach	claim
95	77	Two-settlement electricity markets with price caps and Cournot generation firms	claim
96	77	Design and control of warehouse order picking: A literature review	claim
97	76	Lower bounds and heuristics for the Windy Rural Postman Problem	claim
98	76	Multicriteria tour planning for mobile healthcare facilities in a developing country	claim
99	76	Strategic interactions between channel structure and demand enhancing services	claim
100	76	Rendezvous search on a star graph with examination costs	claim
101	75	Improved modeling and solution methods for the multi-resource routing problem	claim
102	74	Entropy of bi-capacities	claim
103	74	Supply chain models for an assembly system with preprocessing of raw materials	claim
104	74	Bayesian semiparametric analysis for a single item maintenance optimization	claim
105	73	Complete and robust no-fit polygon generation for the irregular stock cutting problem	claim
106	72	Placing a finite size facility with a center objective on a rectangular plane with barriers	claim
107	72	Models and algorithms for three-stage two-dimensional bin packing	claim
108	71	Control and voting power in corporate networks: Concepts and computational aspects	claim
109	71	A classification of assembly line balancing problems	claim
110	70	Solving the maximum edge weight clique problem via unconstrained quadratic programming	claim
111	70	Inventory control under temporal demand heteroscedasticity	claim
112	69	The shortest multipaths problem in a capacitated dense channel	claim
113	69	Incorporating inventory and routing costs in strategic location models	claim
114	69	Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts	claim
115	69	The value of early order commitment in a two-level supply chain	claim
116	68	Multiattribute electronic procurement using goal programming	claim
117	68	The maximin line problem with regional demand	claim
118	68	A tabu search algorithm for a two-dimensional non-guillotine cutting problem	claim
119	66	Newsvendor solutions via conditional value-at-risk minimization	claim
120	66	Analysis of the queue-length distribution for the discrete-time batch-service Geo	claim
121	65	Forecasting daily supermarket sales using exponentially weighted quantile regression	claim
122	65	Pseudolinear fuzzy mappings	claim
123	64	A multi-objective programming approach to 1.5-dimensional assortment problem	claim
124	64	Pricing and volume discounting for a dominant retailer with uncertain manufacturing cost information	claim
125	63	Problem F	claim
126	63	Binary fuzzy goal programming	claim
127	62	Economic order quantity under conditionally permissible delay in payments	claim
128	62	The distribution of power in the European Constitution	claim
129	62	A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation	claim
130	62	Real options in strategic investment games between two asymmetric firms	claim
131	62	Evaluation of inventory policies with unidirectional substitutions	claim
132	60	Batch delivery scheduling with batch delivery cost on a single machine	claim
133	58	Bundling retail products: Models and analysis	claim
134	57	The use of a premium-payment scheme in a supply chain involving capacity acquisition	claim
135	57	Executive views concerning decision support tools	claim
136	56	A Lagrangian relaxation-based heuristic for the vehicle routing with full container load	claim
137	56	Solving a concrete sleepers production scheduling by genetic algorithms	claim
138	56	A tabu search approach for solving a difficult forest harvesting machine location problem	claim
139	49	Linear programming with fuzzy parameters: An interactive method resolution	claim
140	49	Randomly generating portfolio-selection covariance matrices with specified distributional characteristics	claim
141	47	Exact and heuristic procedures for the material handling circular flow path design problem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers