The following pages link to Gerard Sierksma (Q809902):
Displayed 50 items.
- Pyramidal tours and the traveling salesman problem (Q809904) (← links)
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (Q856208) (← links)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Networks in action. Text and computer exercises in network optimization (Q1046718) (← links)
- On Eckhoff's conjecture for Radon numbers; or how far the proof is still away (Q1052642) (← links)
- Intersection theorems for vector spaces (Q1065892) (← links)
- The structure matrix of (0,1)-matrices: Its rank, trace, and eigenvalues. An application to econometric models (Q1078569) (← links)
- A Tverberg-type generalization of the Helly number of a convexity space (Q1156358) (← links)
- Extensions of set partitions (Q1159201) (← links)
- Generalized Radon partitions in convexity spaces (Q1166774) (← links)
- Faces with large diameter on the symmetric traveling salesman polytope (Q1200768) (← links)
- Johann Bernoulli (1667-1748): His ten turbulent years in Groningen (Q1208616) (← links)
- Caratheodory- and Helly-numbers of convex-product-structures (Q1215816) (← links)
- Non-negative matrices: The open Leontief model (Q1259264) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
- Solving the \(k\)-best traveling salesman problem (Q1302605) (← links)
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942) (← links)
- Interchange graphs and the Hamiltonian cycle polytope (Q1382266) (← links)
- Routing helicopters for crew exchanges on off-shore locations (Q1383141) (← links)
- Solving the simple plant location problem using a data correcting approach (Q1411330) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Degeneracy degrees of constraint collections (Q1423697) (← links)
- The composition of semi-finished inventories at a solid board plant. (Q1428051) (← links)
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters (Q1582079) (← links)
- Decomposed vs. integrated control of a one-stage production system (Q1600940) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- Convexities related to path properties on graphs (Q1772411) (← links)
- The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
- Team formation: Matching quality supply and quality demand. (Q1810514) (← links)
- Faces of diameter two on the Hamiltonian cycle polytope (Q1919167) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- Sensitivity analysis of a greedy heuristic for knapsack problems (Q2569123) (← links)
- The Great Leap to the Infinitely Small. Johann Bernoulli: Mathematician and Philosopher (Q2735941) (← links)
- (Q2736040) (← links)
- OR Practice—Training Optimization for the Decathlon (Q3100386) (← links)
- (Q3211080) (← links)
- (Q3334539) (← links)
- (Q3415354) (← links)
- (Q3670072) (← links)
- (Q3675094) (← links)
- (Q3676740) (← links)
- (Q3739292) (← links)
- MULTIPLICITIES OF EIGENVALUES (Q3831128) (← links)
- Limiting polytopes and periodic markov chains (Q3836207) (← links)
- (Q3902107) (← links)
- (Q3948238) (← links)
- Seven criteria for integer sequences being graphic (Q3978365) (← links)
- (Q4081945) (← links)