Journal: SIAM Review

Found 7 papers in total
Teaching integer programming formulations using the traveling salesman problem
Teaching integer programming formulations using the traveling salesman problem
2003,
We designed a simple computational exercise to compare weak and strong integer...
Convergence, oscillations, and chaos in a discrete model of combat
Convergence, oscillations, and chaos in a discrete model of combat
2002,
A piecewise smooth mapping of the three-dimensional Euclidean space is derived from a...
Combinatorial landscapes
Combinatorial landscapes
2002,
Fitness landscapes have proven to be a valuable concept in evolutionary biology,...
Interior methods for nonlinear optimization
Interior methods for nonlinear optimization
2002,
Interior methods are an omnipresent, conspicuous feature of the constrained...
Perfect packing theorems and the average-case behavior of optimal and online bin packing
Perfect packing theorems and the average-case behavior of optimal and online bin packing
2002,
We consider the one-dimensional bin packing problem under the discrete uniform...
Initialization of the simplex algorithm: An artificial-free approach
Initialization of the simplex algorithm: An artificial-free approach
1997,
The simplex algorithm requires artificial variables for solving linear programs which...
Well-solvable special cases of the traveling salesman problem: A survey
Well-solvable special cases of the traveling salesman problem: A survey
1998,
The traveling salesman problem belongs to the most basic, most important, and most...
Papers per page: