IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v7y1999i1p155-161.html
   My bibliography  Save this article

On surrogating 0–1 knapsack constraints

Author

Listed:
  • Laureano Escudero
  • M. Martínez
  • M. Ortuño

Abstract

No abstract is available for this item.

Suggested Citation

  • Laureano Escudero & M. Martínez & M. Ortuño, 1999. "On surrogating 0–1 knapsack constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 155-161, June.
    • Handle: RePEc:spr:topjnl:v:7:y:1999:i:1:p:155-161
    DOI: 10.1007/BF02564717
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02564717
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02564717?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. Fred Glover, 1975. "Surrogate Constraint Duality in Mathematical Programming," Operations Research, INFORMS, vol. 23(3), pages 434-451, June.
    Full references (including those not matched with items on IDEAS)

    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. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    2. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    3. Siddhartha Syam & Bala Shetty, 1998. "Coordinated replenishments from multiple suppliers with price discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 579-598, September.
    4. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    5. Alidaee, Bahram, 2014. "Zero duality gap in surrogate constraint optimization: A concise review of models," European Journal of Operational Research, Elsevier, vol. 232(2), pages 241-248.
    6. Saïd Hanafi & Christophe Wilbaut, 2011. "Improved convergent heuristics for the 0-1 multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 183(1), pages 125-142, March.
    7. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    8. Vairaktarakis, George L. & Cai, Xiaoqiang & Lee, Chung-Yee, 2002. "Workforce planning in synchronous production systems," European Journal of Operational Research, Elsevier, vol. 136(3), pages 551-572, February.
    9. Joseph, Anito & Gass, Saul I. & Bryson, Noel, 1998. "An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem," European Journal of Operational Research, Elsevier, vol. 104(3), pages 601-614, February.
    10. Mohammadi Bidhandi, Hadi & Mohd. Yusuff, Rosnah & Megat Ahmad, Megat Mohamad Hamdan & Abu Bakar, Mohd Rizam, 2009. "Development of a new approach for deterministic supply chain network design," European Journal of Operational Research, Elsevier, vol. 198(1), pages 121-128, October.
    11. Cerqueus, Audrey & Przybylski, Anthony & Gandibleux, Xavier, 2015. "Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems," European Journal of Operational Research, Elsevier, vol. 244(2), pages 417-433.
    12. Djerdjour, Mohamed, 1997. "An enumerative algorithm framework for a class of nonlinear integer programming problems," European Journal of Operational Research, Elsevier, vol. 101(1), pages 104-121, August.
    13. George Vairaktarakis & Janice Kim Winch, 1999. "Worker Cross-Training in Paced Assembly Lines," Manufacturing & Service Operations Management, INFORMS, vol. 1(2), pages 112-131.
    14. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    15. Hadi Bidhandi, 2006. "A new approach based on the surrogating method in the project time compression problems," Annals of Operations Research, Springer, vol. 143(1), pages 237-250, March.
    16. Li, Han-Lin & Fang, Shu-Cherng & Huang, Yao-Huei & Nie, Tiantian, 2016. "An enhanced logarithmic method for signomial programming with discrete variables," European Journal of Operational Research, Elsevier, vol. 255(3), pages 922-934.
    17. Y.M. Ermoliev & A.V. Kryazhimskii & A. Ruszczynski, 1995. "Constraint Aggregation Principle in Convex Optimization," Working Papers wp95015, International Institute for Applied Systems Analysis.
    18. M. A. Venkataramana & John J. Dinkel & John Mote, 1991. "Vector processing approach to constrained network problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 71-85, February.
    19. Selcuk Karabati & Panagiotis Kouvelis & Gang Yu, 2001. "A Min-Max-Sum Resource Allocation Problem and Its Applications," Operations Research, INFORMS, vol. 49(6), pages 913-922, December.
    20. Paola Cappanera & Marco Trubian, 2005. "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 82-98, February.

    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:topjnl:v:7:y:1999:i:1:p:155-161. 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.