Steef L. van de Velde
INFORMS journal on computing · 2002–2005
A researcher in the Science corpus: 2 papers; trusts 0 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Steef L. van de Velde trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Steef L. van de Velde's perspective
Ordered by how strongly the researchers Steef L. van de Velde trusts endorse each paper. Same corpus, a different order for every researcher.
- The NP-Completeness Column: An Ongoing Guide
- An exact algorithm for IP column generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem (INFORMS journal on computing)
- Paths, Trees, and Flowers
- A personal communication
- HOW GOOD IS THE SIMPLEX ALGORITHM
- A and V
- On the computational complexity of Ising spin glass models
- The Complexity of Computing the Permanent
Their papers
- Order batching to minimize total travel time in a parallel-aisle warehouse (2005) — 318 citations
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem (2002) — 326 citations