Skip to main content
SpringerLink
Log in

D. Romero Morales

University of Oxford, United Kingdom

  • Discussion
  • Published:
Top Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Hess S.W., Weaver J.B., Siegfeldt H.J., Whelan J.N. and Zitlau P.A. (1965). Nonpartisan Political Redistricting by Computer.Operations Research 13, 998–1008.

    Article  Google Scholar 

  • Martello S. and Toth P. (1981). An Algorithm for the Generalized Assignment Problem. In: Brans J.P. (ed.),Operational Research’81. IFORS, 589–603.

  • Romeijn H.E. and Piersma N. (2000). A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem.Journal of Combinatorial Optimization 4, 325–355.

    Article  Google Scholar 

  • Romeijn H.E. and Romero Morales D. (2000). A Class of Greedy Algorithms for the Generalized Assignment Problem.Discrete Applied Mathematics 103, 209–235.

    Article  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

About this article

Cite this article

D. Romero Morales. Top 13, 67–69 (2005). https://doi.org/10.1007/BF02578987

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02578987

Keywords

Search

Navigation