The following pages link to Pierre Hansen (Q190032):
Displaying 50 items.
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- On the difference of energies of a graph and its complement graph (Q2306290) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- The geometric-arithmetic index and the chromatic number of connected graphs (Q2410239) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
- Extremal problems for convex polygons (Q2460117) (← links)
- On pitfalls in computing the geodetic number of a graph (Q2463833) (← links)
- On the spectral radius of graphs with a given domination number (Q2479498) (← links)
- On bags and bugs (Q2482094) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- First vs. best improvement: an empirical study (Q2489903) (← links)
- Espaliers: A generalization of dendrograms (Q2563538) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- A relation between proximity and the third largest distance eigenvalue of a graph (Q2659162) (← links)
- (Q2724744) (← links)
- Probabilistic satisfiability (Q2752129) (← links)
- Variable neighborhood search for extremal graphs 3 (Q2756161) (← links)
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming (Q2770097) (← links)
- The assignment problem with seniority and job priority constraints (Q2770118) (← links)
- Developments of variable neighborhood search (Q2776569) (← links)
- Enumeration of all extreme equilibria of bimatrix games (Q2780527) (← links)
- On the distance signless Laplacian of a graph (Q2805691) (← links)
- AutoGraphiX: an automated system for finding conjectures in graph theory (Q2816096) (← links)
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants (Q2837831) (← links)
- The normalized revised Szeged index (Q2856690) (← links)
- Formulation symmetries in circle packing (Q2861569) (← links)
- Primal-dual variable neighborhood search for the simple plant-location problem (Q2892367) (← links)
- (Q3030583) (← links)
- Proximity and remoteness in graphs: Results and conjectures (Q3100689) (← links)
- Pooling Problem: Alternate Formulations and Solution Methods (Q3114904) (← links)
- (Q3115691) (← links)
- Maximizing the Product of Two Linear Functions In 0-1 Variables (Q3150259) (← links)
- Locating Objects in the Plane Using Global Optimization Techniques (Q3169069) (← links)
- (Q3214698) (← links)
- (Q3221775) (← links)
- (Q3315295) (← links)
- (Q3318541) (← links)
- (Q3329223) (← links)
- (Q3348690) (← links)
- (Q3369052) (← links)
- Integral complete split graphs (Q3369068) (← links)
- (Q3377688) (← links)
- (Q3424766) (← links)
- Parallel Variable Neighborhood Search (Q3424832) (← links)
- AutoGraphiX: a survey (Q3439391) (← links)
- (Q3439670) (← links)
- Uncapacitated Plant Location Under Alternative Spatial Price Policies (Q3470229) (← links)
- (Q3497917) (← links)
- The maximum return-on-investment plant location problem with market share (Q3515506) (← links)
