Search Results - subject:"assignment problem"

A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands

Belgacem, Lucile; Charon, Irène; Hudry, Olivier - In: European Journal of Operational Research 232 (2014) 2, pp. 298-306

We consider here a NP-hard problem related to the Routing and Wavelength Assignment (RWA) problem in optical networks, dealing with Scheduled Lightpath Demands (SLDs). An SLD is a connection demand between two nodes of the network, during a certain time. Given a set of SLDs, we want to assign a...

Persistent link: https://www.econbiz.de/10010871255

A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints

Ryu, Seungkyu; Chen, Anthony; Xu, Xiangdong; Choi, Keechoo - In: Networks and Spatial Economics 14 (2014) 2, pp. 245-270

In this paper, we consider the combined distribution and assignment (CDA) problem with link capacity constraints modeled as a hierarchical logit choice problem based on random utility theory. The destination and route choices are calculated based on the multi-nominal logit probability function,...

Persistent link: https://www.econbiz.de/10010865589

A new mixed integer programming model for curriculum balancing: Application to a Turkish university

Ünal, Yusuf Ziya; Uysal, Özgür - In: European Journal of Operational Research 238 (2014) 1, pp. 339-347

Curriculum design is a highly important activity for the academic institutions. It is discussed in literature as a balancing academic curriculum problem (BACP). The BACP schedules courses to different semesters, while balancing the total workload per period. BACP model involves precedence...

Persistent link: https://www.econbiz.de/10011052473

Scheduling with few changes

Mütze, Torsten - In: European Journal of Operational Research 236 (2014) 1, pp. 37-50

In this work we consider scheduling problems where a sequence of assignments from products to machines – or from tasks to operators, or from workers to resources – has to be determined, with the goal of minimizing the costs (=money, manpower, and/or time) that are incurred by the interplay...

Persistent link: https://www.econbiz.de/10011052621

Rental harmony with roommates

Azrieli, Yaron; Shmaya, Eran - In: Journal of Economic Theory 153 (2014) C, pp. 128-137

We prove existence of envy-free allocations in markets with heterogenous indivisible goods and money, when a given quantity is supplied from each of the goods and agents have unit demands. We depart from most of the previous literature by allowing agents' preferences over the goods to depend on...

Persistent link: https://www.econbiz.de/10010930790

Integer programming models for the multidimensional assignment problem with star costs

Walteros, Jose L.; Vogiatzis, Chrysafis; Pasiliao, … - In: European Journal of Operational Research 235 (2014) 3, pp. 553-568

We consider a variant of the multidimensional assignment problem (MAP) with decomposable costs in which the resulting …

Persistent link: https://www.econbiz.de/10010744227

Note on coloring of double disk graphs

Kranjc, Jaka; Lužar, Borut; Mockovčiaková, Martina; … - In: Journal of Global Optimization 60 (2014) 4, pp. 793-799

The coloring of disk graphs is motivated by the frequency assignment problem. In 1998, Malesińska et al. introduced …

Persistent link: https://www.econbiz.de/10011151245

Graph partitions for the multidimensional assignment problem

Vogiatzis, Chrysafis; Pasiliao, Eduardo; Pardalos, Panos - In: Computational Optimization and Applications 58 (2014) 1, pp. 205-224

Multidimensional Assignment Problem (MAP). The problem is defined as finding n disjoint cliques of size m with minimum total cost in K … <Subscript> m×n </Subscript>, which is an m-partite graph with n elements per dimension. Even though the 2-dimensional assignment … problem is solvable in polynomial time, extending the problem to include n≥3 dimensions renders it <InlineEquation ID="IEq1 …

Persistent link: https://www.econbiz.de/10010998323

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems

de Klerk, Etienne; -Nagy, Marianna E.; Sotirov, Renata; … - In: European Journal of Operational Research 233 (2014) 3, pp. 488-499

The reformulation–linearization technique (RLT), introduced in [Sherali, H. D., Adams. W. P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3(3), 411–430], provides a way to...

Persistent link: https://www.econbiz.de/10010719584

An analysis of parameter adaptation in reactive tabu search

Mascia, Franco; Pellegrini, Paola; Birattari, Mauro; … - In: International transactions in operational research : … 21 (2014) 1, pp. 127-152

Persistent link: https://www.econbiz.de/10010234635