largest possible rectangle of letters...

Selecting k sub-posets...

Complexity measurement of NP-complete...

Travelling Salesman - approximation online software?...

Java: Traveling Salesman - Found polynomial algorithm...

How can I reduce this kind of BinPack algorithm? (It might be called sth like MinBreak-BinFill.)...

What are the "hardest" problems using polynomial time?...

Where to find a set of hard Traveling Salesman Problems (with known solutions/approximations)?...

Parabolic knapsack...

NP hard but not NPC...

When NP complete becomes NP hard...

Expression from an array of numbers...

How to find what numbers in a set add up to another given number?...

reducing to np hard...

How hard is this in terms of computational complexity?...

Np-hardness reduction...

Scheduling: P||Cmax...

List of problems that are in general NP-hard but have polynomial-time solution in planar graphs?...

Is this an NP problem?...

Interesting variation to the subset sum problem...

I need high performance. Will there be a difference if I use C or C++?...

A packing algorithm ... kind of...