The following pages link to Hanif D. Sherali (Q173880):
Displaying 50 items.
- RLT insights into lift-and-project closures (Q2257076) (← links)
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes (Q2276885) (← links)
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables (Q2376730) (← links)
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms (Q2390998) (← links)
- Configuration of airspace sectors for balancing air traffic controller workload (Q2393463) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- Applying the sequence-pair representation to optimal facility layout designs (Q2465955) (← links)
- A quantitative approach for scheduling activities to reduce set-up in multiple machine lines (Q2467267) (← links)
- Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations (Q2468736) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints (Q2471112) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
- Mathematical programming models and algorithms for a class--faculty assignment problem (Q2496072) (← links)
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← links)
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- On the numerical solution of the quadratic eigenvalue complementarity problem (Q2630755) (← links)
- Capacitated, balanced, sequential location-allocation problems on chains and trees (Q2638927) (← links)
- On the equivalence between some shortest path algorithms (Q2638955) (← links)
- The eigenvalue complementarity problem (Q2643627) (← links)
- A mixed-integer mathematical modeling approach to exam timetabling (Q2655746) (← links)
- Persistency in 0-1 polynomial programming (Q2757539) (← links)
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems (Q2770136) (← links)
- A tactical decision support system for empty railcar management (Q2783821) (← links)
- National airspace sector occupancy and conflict analysis models for evaluating scenarios under the free-flight paradigm (Q2783895) (← links)
- The second-order cone eigenvalue complementarity problem (Q2811479) (← links)
- A linear mixed-integer programming approach for the unit commitment problem (Q2847610) (← links)
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
- Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting (Q2884489) (← links)
- Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability (Q2892306) (← links)
- Integrated airline schedule design and fleet assignment: polyhedral analysis and Benders' decomposition approach (Q2899083) (← links)
- The nested event tree model with application to combating terrorism (Q2899092) (← links)
- An effective deflected subgradient optimization scheme for implementing column generation for large-scale airline crew scheduling problems (Q2901036) (← links)
- An optimal constrained pruning strategy for decision trees (Q2901047) (← links)
- On Throughput Maximization Problem for UWB-Based Sensor Networks via Reformulation–Linearization Technique (Q2917219) (← links)
- Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem (Q2940539) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- (Q3033553) (← links)
- (Q3053454) (← links)
- Canonical Dual Solutions for Fixed Cost Quadratic Programs (Q3059285) (← links)
- (Q3098533) (← links)
- Selecting Optimal Alternatives and Risk Reduction Strategies in Decision Trees (Q3109867) (← links)
