The following pages link to Pierre Hansen (Q190032):
Displaying 50 items.
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Splitting trees (Q1356762) (← links)
- Mixed graph colorings (Q1360876) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Variable neighborhood search (Q1374041) (← links)
- Paths with minimum range and ratio of arc lengths (Q1377658) (← links)
- Perfect matchings and ears in elementary bipartite graphs (Q1377683) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- Minimum sum of squares clustering in a low dimensional space (Q1393051) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Chemical trees enumeration algorithms (Q1429293) (← links)
- A symmetrical linear maxmin approach to disjoint bilinear programming (Q1586213) (← links)
- The largest small octagon (Q1601419) (← links)
- Boundary uniqueness of fusenes (Q1602690) (← links)
- Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
- New VNP for automatic programming (Q1687679) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square (Q1759867) (← links)
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (Q1761225) (← links)
- Maximum split clustering under connectivity constraints (Q1762820) (← links)
- On the geometry of Nash equilibria and correlated equilibria (Q1767468) (← links)
- Proximity, remoteness and girth in graphs (Q1786868) (← links)
- Sensitivity analysis in multiple objective linear programming: The tolerance approach (Q1823157) (← links)
- The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
- Variable neighborhood decomposition search (Q1850963) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Extension of Turán's theorem to the 2-stability number (Q1865136) (← links)
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal (Q1881682) (← links)
- Improving interval analysis bounds by translations (Q1888143) (← links)
- An exact method for fractional goal programming (Q1888164) (← links)
- Boole's conditions of possible experience and reasoning under uncertainty (Q1894361) (← links)
- Shortest shortest path trees of a network (Q1917275) (← links)
- Heuristic reliability optimization by tabu search (Q1919847) (← links)
- On proper refinement of Nash equilibria for bimatrix games (Q1941251) (← links)
- A survey of Nordhaus-Gaddum type relations (Q1941378) (← links)
- The small octagons of maximal width (Q1953053) (← links)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming (Q1970300) (← links)
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system (Q1970574) (← links)
- Corrigendum to: ``On the difference of energies of a graph and its complement graph'' (Q1979400) (← links)
- Using symbolic calculations to determine largest small polygons (Q2046342) (← links)
- Global exact optimization for covering a rectangle with 6 circles (Q2131145) (← links)
- Distributed integral column generation for set partitioning problems (Q2139355) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- A note on bimatrix game maximal Selten subsets (Q2254918) (← links)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- Integral simplex using double decomposition for set partitioning problems (Q2273675) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Optimum departure times for commuters in congested networks (Q2277160) (← links)
