The following pages link to Pierre Hansen (Q190032):
Displaying 50 items.
- A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES (Q3560092) (← links)
- (Q3598873) (← links)
- Average distance and maximum induced forest (Q3605159) (← links)
- An Oil Pipeline Design Problem (Q3635187) (← links)
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille (Q3644810) (← links)
- An Algorithm for a Constrained Weber Problem (Q3657741) (← links)
- (Q3659517) (← links)
- (Q3682510) (← links)
- Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267) (← links)
- The Minisum and Minimax Location Problems Revisited (Q3705190) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- (Q3755206) (← links)
- Problème de la bipartition minimale d'un graphe (Q3765553) (← links)
- (Q3775339) (← links)
- Efficient points on a network (Q3787761) (← links)
- Algorithms for Voting and Competitive Location on a Network (Q3818091) (← links)
- Implicit Treatment of “Zero or Range” Constraints in a Model for Minimum Cost Foundry Alloys (Q3818788) (← links)
- The continuousp-median of a network (Q3830784) (← links)
- Global minimization of univariate functions by sequential polynomial approximation (Q3831959) (← links)
- (Q3835301) (← links)
- (Q3861430) (← links)
- Methods of Nonlinear 0-1 Programming (Q3863696) (← links)
- (Q3869362) (← links)
- (Q3879273) (← links)
- (Q3884137) (← links)
- (Q3888874) (← links)
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results (Q3896801) (← links)
- (Q3903895) (← links)
- (Q3907407) (← links)
- Bicriterion Cluster Analysis (Q3908335) (← links)
- Constrained Location and the Weber-Rawls Problem (Q3923906) (← links)
- (Q3928843) (← links)
- (Q3929509) (← links)
- (Q3953184) (← links)
- Deux problèmes d'affectation non linéaires (Q3953578) (← links)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467) (← links)
- From the median to the generalized center (Q3971961) (← links)
- An algorithm for the minimum variance point of a network (Q3971963) (← links)
- Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes. (A primal algorithm of generalized linear programming for mixed integer programs) (Q3986703) (← links)
- New Branch-and-Bound Rules for Linear Bilevel Programming (Q4021697) (← links)
- (Q4022666) (← links)
- Column Generation Methods for Probabilistic Logic (Q4025903) (← links)
- (Q4048855) (← links)
- (Q4053391) (← links)
- (Q4062936) (← links)
- (Q4062940) (← links)
- (Q4065285) (← links)
- (Q4068768) (← links)
- (Q4083205) (← links)
- Sequence comparison by dynamic programming (Q4084868) (← links)
