IDEAS home Printed from https://ideas.repec.org/a/inm/orited/v17y2017i2p85-89.html
   My bibliography  Save this article

Puzzle—The Fillomino Puzzle

Author

Listed:
  • Robin H. Pearce

    (School of Mathematics and Physics, University of Queensland, Brisbane, St. Lucia, Austrilia QLD 4072)

  • Michael A. Forbes

    (School of Mathematics and Physics, University of Queensland, Brisbane, St. Lucia, Austrilia QLD 4072)

Abstract

Logic puzzles form an excellent set of problems for the teaching of advanced solution techniques in operations research. They are an opportunity for students to test their modelling skills on a different style of problem, and some puzzles even require advanced techniques to become tractable. Fillomino is a puzzle in which the player must enter integers into a grid to satisfy certain rules. This puzzle is a good exercise in using lazy constraints and composite variables to solve difficult problems.

Suggested Citation

  • Robin H. Pearce & Michael A. Forbes, 2017. "Puzzle—The Fillomino Puzzle," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 85-89, January.
    • Handle: RePEc:inm:orited:v:17:y:2017:i:2:p:85-89
    DOI: 10.1287/ited.2016.0166
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ited.2016.0166
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ited.2016.0166?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
    ---><---

    References listed on IDEAS

    as
    1. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    2. Meuffels, W.J.M. & den Hertog, D., 2010. "Solving the Battleship puzzle as an integer programming problem," Other publications TiSEM 7cd77b04-eb53-4e21-9d4b-6, Tilburg University, School of Economics and Management.
    3. W. J. M. Meuffels & D. den Hertog, 2010. "Puzzle ---Solving the Battleship Puzzle as an Integer Programming Problem," INFORMS Transactions on Education, INFORMS, vol. 10(3), pages 156-162, May.
    4. Martin J. Chlond, 2005. "Classroom Exercises in IP Modeling: Su Doku and the Log Pile," INFORMS Transactions on Education, INFORMS, vol. 5(2), pages 77-79, January.
    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. Mitchell Harris & Michael Forbes, 2023. "The Snake Eggs Puzzle: Preparing Students for Benders Decomposition," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 210-217, May.
    2. Mehdi Iranpoor, 2021. "Knights Exchange Puzzle—Teaching the Efficiency of Modeling," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 108-114, January.
    3. SönkeHartmann, 2018. "Puzzle—Solving Smartphone Puzzle Apps by Mathematical Programming," INFORMS Transactions on Education, INFORMS, vol. 18(2), pages 127-141, January.

    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. Jeroen Beliën & Jan Colpaert & Liesje De Boeck & Johan Eyckmans & Wouter Leirens, 2013. "Teaching Integer Programming Starting From an Energy Supply Game," INFORMS Transactions on Education, INFORMS, vol. 13(3), pages 129-137, May.
    2. Ian D. Frommer & Robert W. Day, 2017. "Game—A Carbon Emissions Game," INFORMS Transactions on Education, INFORMS, vol. 18(1), pages 56-70, September.
    3. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    4. Hoogervorst, R. & Dollevoet, T.A.B. & Maróti, G. & Huisman, D., 2018. "Reducing Passenger Delays by Rolling Stock Rescheduling," Econometric Institute Research Papers EI2018-29, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. Lentink, R.M. & Fioole, P-J. & Kroon, L.G. & van 't Woudt, C., 2003. "Applying Operations Research techniques to planning of train shunting," ERIM Report Series Research in Management ERS-2003-094-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    6. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    7. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    8. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    9. Andreas Ernst & Houyuan Jiang & Mohan Krishnamoorthy, 2006. "Exact Solutions to Task Allocation Problems," Management Science, INFORMS, vol. 52(10), pages 1634-1646, October.
    10. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    11. 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.
    12. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    13. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    14. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    15. Erwin Abbink & Matteo Fischetti & Leo Kroon & Gerrit Timmer & Michiel Vromans, 2005. "Reinventing Crew Scheduling at Netherlands Railways," Interfaces, INFORMS, vol. 35(5), pages 393-401, October.
    16. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    17. Samuel Deleplanque & Martine Labbé & Diego Ponce & Justo Puerto, 2020. "A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 582-599, July.
    18. Ali, Agha Iqbal & O'Connor, Debra J., 2010. "The impact of distribution system characteristics on computational tractability," European Journal of Operational Research, Elsevier, vol. 200(2), pages 323-333, January.
    19. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    20. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.

    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:inm:orited:v:17:y:2017:i:2:p:85-89. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.