-
Recent Posts
- Fault Detection in Logic Circuits March 8, 2024
- Minimum Weight And/Or Graph Solution February 15, 2024
- Decision Tree February 2, 2024
- Simply Deviated Disjunction January 19, 2024
- Matrix Cover January 8, 2024
Recent Comments
Archives
- March 2024
- February 2024
- January 2024
- December 2023
- October 2023
- September 2023
- August 2023
- March 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- June 2022
- May 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
Categories
- Algebra and Number Theory
- Appendix- Algebra and Number Theory
- Appendix- Automata and Language Theory
- Appendix- Games and Puzzles
- Appendix- Mathematical Programming
- Appendix- Network Design
- Appendix- Program Optimization
- Appendix- Sets and Partitions
- Appendix-Graph Theory
- Appendix-Logic
- Appendix: Miscellaneous
- Appendix: Sequencing and Scheduling
- Appendix: Storage and Retrieval
- Chapter 3 Exercises
- Core Problems
- Overview
- Problems not in appendix
- Uncategorized
Tag Archives: Hamiltonian Circuit
Protected: Traveling Salesman Polytope Non-Adjacency
Enter your password to view comments.
Posted in Appendix- Mathematical Programming
Tagged 3SAT, Difficulty 9, Hamiltonian Circuit, MP8, Traveling Salesman Polytope Non-Adjacency
Protected: No-Wait Flow-Shop Scheduling
Enter your password to view comments.
Posted in Appendix: Sequencing and Scheduling
Tagged Difficulty 8, Flow-Shop Scheduling, Hamiltonian Circuit, No-wait flow-shop scheduling, Traveling Salesman
Protected: Bounded Post Correspondence Problem
Enter your password to view comments.
Posted in Appendix: Storage and Retrieval
Tagged Bounded Post Correspondence Problem, Difficulty 10, Hamiltonian Circuit, Shortest Common Supersequence, SR11
Protected: Quadratic Assignment Problem
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Difficulty 2, Difficulty 4, Hamiltonian Circuit, ND43, Optimal Linear Arrangement, Quadratic Assignment
Protected: Stacker-Crane
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Difficulty 4, Difficulty 5, Hamiltonian Circuit, ND26, Rural Postman, Stacker-Crane
Protected: Rural Postman
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Difficulty 4, Hamiltonian Circuit, ND27, Rural Postman
Protected: Traveling Salesman, Bottleneck Traveling Salesman
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Bottleneck TSP, Difficulty 2, Hamiltonian Circuit, ND22, ND24, TSP
Protected: Biconnectivity Augmentation, Strong Connectivity Augmentation
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Biconnectivity Augmentation, Difficulty 3, Hamiltonian Circuit, ND18, ND19, Strong Connectivity Augmentation
Protected: Hamiltonian Completion
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged Difficulty 1, Difficulty 2, GT33, Gt34, Hamiltonian Circuit, Hamiltonian Completion, Hamiltonian Path, No G&J reference, uncited reduction
Protected: Minimum K-Connected Subgraph
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged Difficulty 4, Difficulty 6, GT31, Hamiltonian Circuit, Minimum K-Connected Subgraph, uncited reduction