IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v54y1989i2p237-247.html
   My bibliography  Save this article

A maximin model for IRT-based test design with practical constraints

Author

Listed:
  • Wim Linden
  • Ellen Boekkooi-Timminga

Abstract

No abstract is available for this item.

Suggested Citation

  • Wim Linden & Ellen Boekkooi-Timminga, 1989. "A maximin model for IRT-based test design with practical constraints," Psychometrika, Springer;The Psychometric Society, vol. 54(2), pages 237-247, June.
    • Handle: RePEc:spr:psycho:v:54:y:1989:i:2:p:237-247
    DOI: 10.1007/BF02294518
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02294518
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02294518?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. George B. Dantzig, 1957. "Discrete-Variable Extremum Problems," Operations Research, INFORMS, vol. 5(2), pages 266-288, April.
    2. T. Theunissen, 1985. "Binary programming and test design," Psychometrika, Springer;The Psychometric Society, vol. 50(4), pages 411-420, December.
    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. Michael Brusco & Hans Köhn & Douglas Steinley, 2013. "Exact and approximate methods for a one-dimensional minimax bin-packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 611-626, July.
    2. Sundararaghavan, P.S. & Kunnathur, Anand & Fang, Xiao, 2010. "Sequencing questions to ferret out terrorists: Models and heuristics," Omega, Elsevier, vol. 38(1-2), pages 12-19, February.
    3. Martijn G. de Jong & Jan-Benedict E. M. Steenkamp & Bernard P. Veldkamp, 2009. "A Model for the Construction of Country-Specific Yet Internationally Comparable Short-Form Marketing Scales," Marketing Science, INFORMS, vol. 28(4), pages 674-689, 07-08.
    4. Bernard Veldkamp, 2013. "Application of robust optimization to automated test assembly," Annals of Operations Research, Springer, vol. 206(1), pages 595-610, July.

    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. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    2. Iida, Hiroshi, 2011. "How to solve the collapsing subset-sum problem revisited," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/4432, Otaru University of Commerce.
    3. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Apr 2024.
    4. Herweg, Fabian & Müller, Daniel, 2008. "The Optimality of Simple Contracts: Moral Hazard and Loss Aversion," Bonn Econ Discussion Papers 17/2008, University of Bonn, Bonn Graduate School of Economics (BGSE).
    5. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    6. B. Golany & N. Goldberg & U. Rothblum, 2015. "Allocating multiple defensive resources in a zero-sum game setting," Annals of Operations Research, Springer, vol. 225(1), pages 91-109, February.
    7. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2020. "On the difficulty of budget allocation in claims problems with indivisible items of different prices," ThE Papers 20/09, Department of Economic Theory and Economic History of the University of Granada..
    8. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2021. "On the Difficulty of Budget Allocation in Claims Problems with Indivisible Items and Prices," Group Decision and Negotiation, Springer, vol. 30(5), pages 1133-1159, October.
    9. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    10. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2023. "Features for the 0-1 knapsack problem based on inclusionwise maximal solutions," European Journal of Operational Research, Elsevier, vol. 311(1), pages 36-55.
    11. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
    12. Christoph Buchheim & Dorothee Henke & Jannik Irmai, 2022. "The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower’s Objective," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 521-542, August.
    13. Cedric A. Lehmann & Christiane B. Haubitz & Andreas Fügener & Ulrich W. Thonemann, 2022. "The risk of algorithm transparency: How algorithm complexity drives the effects on the use of advice," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3419-3434, September.
    14. Yanhong Feng & Xu Yu & Gai-Ge Wang, 2019. "A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1 Knapsack Problems," Mathematics, MDPI, vol. 7(11), pages 1-31, November.
    15. Taylan İlhan & Seyed M. R. Iravani & Mark S. Daskin, 2011. "TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards," Operations Research, INFORMS, vol. 59(1), pages 242-248, February.
    16. M. Eric Johnson & Margaret L. Brandeau, 1999. "Design of an Automated Shop Floor Material Handling System with Inventory Considerations," Operations Research, INFORMS, vol. 47(1), pages 65-80, February.
    17. Altay, Nezih & Robinson Jr., Powell E. & Bretthauer, Kurt M., 2008. "Exact and heuristic solution approaches for the mixed integer setup knapsack problem," European Journal of Operational Research, Elsevier, vol. 190(3), pages 598-609, November.
    18. Bian, Zheyong & Bai, Yun & Douglas, W. Scott & Maher, Ali & Liu, Xiang, 2022. "Multi-year planning for optimal navigation channel dredging and dredged material management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    19. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    20. Christos A. Kontovas & Krishna Sooprayen, 2020. "Maritime Cargo Prioritisation during a Prolonged Pandemic Lockdown Using an Integrated TOPSIS-Knapsack Technique: A Case Study on Small Island Developing States—The Rodrigues Island," Sustainability, MDPI, vol. 12(19), pages 1-20, September.

    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:spr:psycho:v:54:y:1989:i:2:p:237-247. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.