Sherali Hanif D.

Hanif D. Sherali

Information about the author Hanif D. Sherali will soon be added to the site.
Found 82 papers in total
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
2008
Extending our work on second-order cover cuts, we introduce a new class of...
The prize collecting Steiner tree problem: models and Lagrangean dual optimization approaches
The prize collecting Steiner tree problem: models and Lagrangean dual optimization approaches
2008
We propose a generalized version of the Prize Collecting Steiner Tree Problem (PCSTP),...
Mathematical programming models and algorithms for a class–faculty assignment problem
Mathematical programming models and algorithms for a class–faculty assignment problem
2006
This paper presents mathematical programming models for assigning faculty members to...
Airline fleet assignment concepts, models, and algorithms
Airline fleet assignment concepts, models, and algorithms
2006
The fleet assignment problem (FAP) deals with assigning aircraft types, each having a...
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
2007
Network design problems arise in a wide range of applied areas including...
Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations
Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations
2007
This paper is concerned with the problem of assigning employees to gas stations owned...
Applying the sequence-pair representation to optimal facility layout designs
Applying the sequence-pair representation to optimal facility layout designs
2007
We present a new formulation for the facility layout problem based on the...
Reformulation-linearization/convexification technique: a unified approach for discrete and continuous nonconvex optimization
Reformulation-linearization/convexification technique: a unified approach for discrete and continuous nonconvex optimization
2007
This paper is one in a special issue of Annals of Operations Research devoted to the...
A new reformulation approach for the generalized partial covering problem
A new reformulation approach for the generalized partial covering problem
2006
In this paper, we consider a situation in which a group of facilities must be...
An airspace-planning and collaborative decision-making model: Part II – cost model, data considerations, and computations
An airspace-planning and collaborative decision-making model: Part II – cost model, data considerations, and computations
2006
In Part I of this paper, we presented a large-scale airspace-planning and...
A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
2006
In this paper a branch-and-bound algorithm is proposed for finding a global minimum to...
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
2006
In this paper, we present a new class of polynomial length formulations for the...
Polyhedral analysis and algorithms for a demand-driven refleeting model for aircraft assignment
Polyhedral analysis and algorithms for a demand-driven refleeting model for aircraft assignment
2005
The current airline practice in conducting fleet assignments is to begin assigning...
Partial convexification cuts for 0–1 mixed-integer programs
Partial convexification cuts for 0–1 mixed-integer programs
2005
In this research, we propose a new cut generation scheme based on constructing a...
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
2005
We consider linear mixed-integer programs where a subset of the variables are...
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
2005
This paper studies the polyhedral structure of dynamic fixed-charge problems that have...
A global optimization RLT-based approach for solving the fuzzy clustering problem
A global optimization RLT-based approach for solving the fuzzy clustering problem
2005
The field of cluster analysis is primarily concerned with the partitioning of data...
Chvatal–Gomory–tier cuts for general integer programs
Chvatal–Gomory–tier cuts for general integer programs
2005
In this paper, we introduce a new class of cutting planes called Chvatal–Gomory...
An airspace planning and collaborative decision-making model: Part I – probabilistic conflicts, workload, and equity considerations
An airspace planning and collaborative decision-making model: Part I – probabilistic conflicts, workload, and equity considerations
2003
We present a large-scale, airspace planning and collaborative decision-making model...
A variable target value method for nondifferentiable optimization
A variable target value method for nondifferentiable optimization
2000
This paper presents a new Variable target value method (VTVM) that can be used in...
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
2005
We propose a new formulation for the asymmetric traveling salesman problem, with and...
On embedding the volume algorithm in a variable target value method
On embedding the volume algorithm in a variable target value method
2004
We employ the volume algorithm as a subgradient deflection strategy in a variable...
Radar pulse interleaving for multi-target tracking
Radar pulse interleaving for multi-target tracking
2004
In a multifunction radar, the maximum number of targets that can be managed or tracked...
An airspace planning and collaborative decision-making model: Part I – probabilistic conflicts, workload, and equity considerations
An airspace planning and collaborative decision-making model: Part I – probabilistic conflicts, workload, and equity considerations
2003
We present a large-scale, airspace planning and collaborative decision-making model...
Papers per page: