The following pages link to Hanif D. Sherali (Q173880):
Displayed 50 items.
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- A column generation approach for determining optimal fleet mix, schedules, and transshipment facility locations for a vessel transportation problem (Q346154) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
- Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- On the solution of the inverse eigenvalue complementarity problem (Q467406) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- Enhancing RLT relaxations via a new class of semidefinite cuts (Q598599) (← links)
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse (Q598605) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- A fractional programming approach for retail category price optimization (Q708901) (← links)
- On an enumerative algorithm for solving eigenvalue complementarity problems (Q742298) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Airline fleet assignment concepts, models, and algorithms (Q818075) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- An inverse reliability-based approach for designing under uncertainty with application to robust piston design (Q868632) (← links)
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations (Q872118) (← links)
- Models and algorithms for job selection, routing, and scheduling in a flexible manufacturing system (Q922270) (← links)
- Conjugate gradient methods using quasi-Newton updates with inexact line searches (Q922642) (← links)
- Second-order cover inequalities (Q927162) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- Interleaving two-phased jobs on a single machine (Q1019298) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Nondominated cuts for disjunctive programs and polyhedral annexation methods (Q1056349) (← links)
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem (Q1058456) (← links)
- A restriction and feasible direction algorithm for a capacity expansion problem (Q1063517) (← links)
- Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree (Q1067987) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- A nonlinear hierarchical approach for incorporating solar generation units in electric utility capacity expansion plans (Q1085052) (← links)
- Convergence analysis and algorithmic implications of two dynamic processes toward an oligopoly-competitive fringe equilibrium solution (Q1092775) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- Bounds on penalties for dummy arcs in transportation networks (Q1117136) (← links)