Skip to content

Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Tag Archives: Optimal Linear Arrangement

Protected: Scheduling to Minimize Weighted Completion Time

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix: Sequencing and Scheduling and tagged Difficulty 4, Difficulty 6, Optimal Linear Arrangement, Sequencing to Minimize Weighted Completion Time, SS4 on December 18, 2017 by Sean T. McCulloch.

Protected: Consecutive Ones Matrix Augmentation

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Consecutive Ones Matrix Augmentation, Consecutive Ones Matrix Problems, Consecutive Ones Submatrix, Difficulty 4, Difficulty 6, Optimal Linear Arrangement, SR16 on May 16, 2017 by Sean T. McCulloch.

Protected: Quadratic Assignment Problem

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 2, Difficulty 4, Hamiltonian Circuit, ND43, Optimal Linear Arrangement, Quadratic Assignment on July 19, 2016 by Sean T. McCulloch.

Protected: Rooted Tree Arrangement

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 7, Optimal Linear Arrangement, Rooted Tree Arrangement on June 2, 2015 by Sean T. McCulloch.

Protected: Directed Optimal Linear Arrangement

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 8, Directed Optimal Linear Arrangement, GT43, Optimal Linear Arrangement on May 19, 2015 by Sean T. McCulloch.

Protected: Interval Graph Completion

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 9, GT35, Interval Graph Completion, Optimal Linear Arrangement on March 24, 2015 by Sean T. McCulloch.

Protected: Optimal Linear Arrangement

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged Bipartite Subgraph, Difficulty 8, GT42, Optimal Linear Arrangement, Simple Max-Cut on March 17, 2015 by Sean T. McCulloch.

Search for:

Recent Posts

And That’s It! August 21, 2025
Fault Detection With Test Points August 20, 2025
Fault Detection in Directed Graphs August 13, 2025
Fault Detection in Logic Circuits March 8, 2024
Minimum Weight And/Or Graph Solution February 15, 2024

Recent Comments

Sean T. McCulloch on And That’s It!
Greg Hamerly on And That’s It!
Sean T. McCulloch on Exact Cover by 3-Sets
nifets on Exact Cover by 3-Sets
Sean T. McCulloch on Fault Detection in Logic Circuits

Archives

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

Proudly powered by WordPress