The following pages link to Hanif D. Sherali (Q173880):
Displayed 50 items.
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Optimization with disjunctive constraints (Q1141585) (← links)
- On the choice of step size in subgradient optimization (Q1149883) (← links)
- A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
- Item:Q173880 (redirect page) (← links)
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples (Q1161923) (← links)
- Linear programming based analysis of marginal cost pricing in electric utility capacity expansion (Q1166409) (← links)
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
- A leader-follower model and analysis for a two-stage network of oligopolies (Q1184520) (← links)
- Minisum amd minimax paths of a moving facility on a network (Q1186001) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems (Q1280199) (← links)
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075) (← links)
- A global optimization approach to a water distribution network design problem (Q1365376) (← links)
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (Q1366300) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets (Q1384437) (← links)
- Global optimization of nonconvex polynomial programming problems having rational exponents (Q1387651) (← links)
- A pseudo-global optimization approach with application to the design of containerships (Q1404393) (← links)
- An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies. (Q1406655) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- An approach for analyzing foreign direct investment projects with application to China's Tumen River area development. (Q1422341) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Evolution and state-of-the-art in integer programming (Q1593833) (← links)
- Effective relaxations and partitioning schemes for solving water distribution network design problems to global optimality (Q1595894) (← links)
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
- A class of web-based facets for the generalized vertex packing problem (Q1763480) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Dorn's duality for quadratic programs revisited: The nonconvex case (Q1804072) (← links)
- Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods (Q1819151) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- On a fractional minimal cost flow problem on networks (Q1926638) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem (Q1941390) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- A variable target value method for nondifferentiable optimization (Q1970420) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- On the computation of all eigenvalues for the eigenvalue complementarity problem (Q2250083) (← links)
- Aggregate-level demand management in evacuation planning (Q2253407) (← links)