The following pages link to Pierre Hansen (Q190032):
Displayed 50 items.
- Identification of all steady states in large networks by logical analysis (Q253470) (← links)
- Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering (Q286614) (← links)
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
- Proximity, remoteness and distance eigenvalues of a graph (Q313783) (← links)
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Sequential clustering with radius and split criteria (Q351557) (← links)
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- Improving heuristics for network modularity maximization using an exact algorithm (Q406498) (← links)
- Improving constrained pattern mining with first-fail-based heuristics (Q408638) (← links)
- Column generation bounds for numerical microaggregation (Q486386) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Remarks on solutions to a nonconvex quadratic programming test problem (Q540711) (← links)
- On the extremal values of the second largest \(Q\)-eigenvalue (Q550643) (← links)
- Item:Q190032 (redirect page) (← links)
- Minimum sum of diameters clustering (Q581969) (← links)
- Recognizing sign solvable graphs (Q585223) (← links)
- A note on reduction of quadratic and bilinear programs with equality constraints (Q598586) (← links)
- A note on diameters of point sets (Q601983) (← links)
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
- The small hexagon and heptagon with maximum sum of distances between vertices (Q628747) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- A new column generation algorithm for logical analysis of data (Q646710) (← links)
- Using size for bounding expressions of graph invariants (Q646725) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (Q679069) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- On a conjecture about the Szeged index (Q709235) (← links)
- A short discussion of the OR crisis (Q721666) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- The continuous center set of a network (Q757234) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
- Variations on the Roy-Gallai theorem (Q816578) (← links)
- A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
- The small octagon with longest perimeter (Q857420) (← links)
- A note on duality gap in the simple plant location problem (Q858326) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- On a conjecture about the Randić index (Q864167) (← links)
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games (Q868531) (← links)
- New heuristic for harmonic means clustering (Q887198) (← links)
- Community detection with the weighted parsimony criterion (Q904925) (← links)
- Variable neighborhood search for minimum cost berth allocation (Q932179) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)