The following pages link to Hanif D. Sherali (Q173880):
Displayed 50 items.
- Improving Discrete Model Representations via Symmetry Considerations (Q3114738) (← links)
- Optimal Allocation of Risk-Reduction Resources in Event Trees (Q3117724) (← links)
- (Q3134873) (← links)
- (Q3160276) (← links)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems (Q3197621) (← links)
- A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions (Q3200878) (← links)
- A versatile scheme for ranking the extreme points of an assignment polytope (Q3320125) (← links)
- A Decomposition Algorithm for a Discrete Location-Allocation Problem (Q3337913) (← links)
- Intertemporal Allocation of Capital Costs in Electric Utility Capacity Expansion Planning Under Uncertainty (Q3340615) (← links)
- (Q3372336) (← links)
- (Q3372337) (← links)
- Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands (Q3392178) (← links)
- Two-stage workforce planning under demand fluctuations and uncertainty (Q3394040) (← links)
- On the asymmetric eigenvalue complementarity problem (Q3396385) (← links)
- A new reformulation approach for the generalized partial covering problem (Q3423275) (← links)
- A column generation approach for an employee scheduling problem with multiple shifts and work locations (Q3505937) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- Models and algorithms for the scheduling of a doubles tennis training tournament (Q3582648) (← links)
- Global Optimization Procedures for the Capacitated Euclidean and <i>l<sub>p</sub></i> Distance Multifacility Location-Allocation Problems (Q3635104) (← links)
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems (Q3635128) (← links)
- Enhanced Model Formulations for Optimal Facility Layout (Q3637376) (← links)
- (Q3649086) (← links)
- Nonadjacent extreme point methods for solving linear programs (Q3673477) (← links)
- (Q3675895) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Sequential location-allocation problems on chains and trees with probabilistic link demands (Q3686391) (← links)
- A Multiple Leader Stackelberg Model and Analysis (Q3703541) (← links)
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions (Q3703585) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884) (← links)
- Mathematical Analysis of the Interactions Between Oligopolistic Firms and a Competitive Fringe (Q3757650) (← links)
- An Integer Programming Approach and Implementation for an Electric Utility Capacity Planning Problem with Renewable Energy Sources (Q3762034) (← links)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072) (← links)
- A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization (Q3778562) (← links)
- A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands (Q3779968) (← links)
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (Q3790916) (← links)
- NP-Hard, Capacitated, Balanced <i>p</i>-Median Problems on a Chain Graph with a Continuum of Link Demands (Q3796941) (← links)
- (Q3798476) (← links)
- A Mathematical Programming Approach to a Nash-Cournot Equilibrium Analysis for a Two-Stage Network of Oligopolies (Q3804407) (← links)
- (Q3815129) (← links)
- (Q3865854) (← links)
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem (Q3870675) (← links)
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
- On the generation of deep disjunctive cutting planes (Q3885524) (← links)
- Expedients for solving some specially structured mixed-integer programs (Q3916376) (← links)
- A mathematical programming approach for determining oligopolistic market equilibrium (Q3947414) (← links)
- A property regarding degenerate pivots for linear assignment networks (Q3958290) (← links)
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem (Q3962772) (← links)
- (Q3998396) (← links)