IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v81y1995i1p166-175.html
   My bibliography  Save this article

A note on the rule for sequential selection

Author

Listed:
  • Mehrez, Abraham
  • Rabinowitz, Gad

Abstract

No abstract is available for this item.

Suggested Citation

  • Mehrez, Abraham & Rabinowitz, Gad, 1995. "A note on the rule for sequential selection," European Journal of Operational Research, Elsevier, vol. 81(1), pages 166-175, February.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:1:p:166-175
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0234-O
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Joseph B. Kadane, 1978. "A Characterization of the Rau Class of Sequential Problems," Mathematics of Operations Research, INFORMS, vol. 3(1), pages 42-56, February.
    2. Sinclair, Marius, 1986. "An exact penalty function approach for nonlinear integer programming problems," European Journal of Operational Research, Elsevier, vol. 27(1), pages 50-56, October.
    3. F. P. Kelly, 1982. "A Remark on Search and Sequencing Problems," Mathematics of Operations Research, INFORMS, vol. 7(1), pages 154-157, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stein, William E. & Seale, Darryl A. & Rapoport, Amnon, 2003. "Analysis of heuristic solutions to the best choice problem," European Journal of Operational Research, Elsevier, vol. 151(1), pages 140-152, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    2. George J. Kyparisis & Christos Koulamas, 2011. "A note on the optimality of index priority rules for search and sequencing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 83-87, March.
    3. Teles, João P. & Castro, Pedro M. & Matos, Henrique A., 2013. "Univariate parameterization for global optimization of mixed-integer polynomial problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 613-625.
    4. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    5. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.
    6. Rostami, Salim & Creemers, Stefan & Wei, Wenchao & Leus, Roel, 2019. "Sequential testing of n-out-of-n systems: Precedence theorems and exact methods," European Journal of Operational Research, Elsevier, vol. 274(3), pages 876-885.
    7. Xiaojin Zheng & Xiaoling Sun & Duan Li & Yong Xia, 2010. "Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 864-880, November.
    8. George Steiner & Dan Wang & Yufei Yuan, 1992. "Primal dual algorithms for the vehicle refueling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(7), pages 905-918, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:81:y:1995:i:1:p:166-175. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.