Hanif D. Sherali

According to our database1, Hanif D. Sherali authored at least 268 papers between 1980 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A Complementary Column Generation Approach for the Graph Equipartition Problem.
Informatica, 2020

2019
A New Compact Formulation for the Daily Crew Pairing Problem.
Transp. Sci., 2019

2018
Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions.
J. Oper. Res. Soc., 2018

A Mathematical Modelling and Optimization Approach for a Maritime Facility Location Transshipment Problem.
Informatica, 2018

2017
A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem.
Transp. Sci., 2017

A Column Generation Mathematical Model for a Teaching Assistant Workload Assignment Problem.
Informatica, 2017

Enhancing the solvability of network optimization problems through model augmentations.
Proceedings of the 13th Annual Conference on Wireless On-demand Network Systems and Services, 2017

2016
Joint Congestion Control and Routing Optimization: An Efficient Second-Order Distributed Approach.
IEEE/ACM Trans. Netw., 2016

A Scheduling Algorithm for MIMO DoF Allocation in Multi-Hop Networks.
IEEE Trans. Mob. Comput., 2016

The second-order cone eigenvalue complementarity problem.
Optim. Methods Softw., 2016

On the numerical solution of the quadratic eigenvalue complementarity problem.
Numer. Algorithms, 2016

RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems.
Math. Program. Comput., 2016

On Throughput Region for Primary and Secondary Networks With Node-Level Cooperation.
IEEE J. Sel. Areas Commun., 2016

2015
Multi-Node Wireless Energy Charging in Sensor Networks.
IEEE/ACM Trans. Netw., 2015

RLT insights into lift-and-project closures.
Optim. Lett., 2015

A Mobile Platform for Wireless Charging and Data Collection in Sensor Networks.
IEEE J. Sel. Areas Commun., 2015

On wireless network infrastructure optimisation for cyber-physical systems in future smart buildings.
Int. J. Sens. Networks, 2015

Mathematical models and algorithms for a high school timetabling problem.
Comput. Oper. Res., 2015

A column generation mathematical programming approach for a class-faculty assignment problem with preferences.
Comput. Manag. Sci., 2015

Optimal throughput curve for primary and secondary users with node-level cooperation.
Proceedings of the IEEE International Symposium on Dynamic Spectrum Access Networks, 2015

2014
Joint Optimization of Session Grouping and Relay Node Selection for Network-Coded Cooperative Communications.
IEEE Trans. Mob. Comput., 2014

Minimizing conditional-value-at-risk for stochastic scheduling problems.
J. Sched., 2014

On the Solution of the Inverse Eigenvalue Complementarity Problem.
J. Optim. Theory Appl., 2014

Optimal evacuation planning using staging and routing.
J. Oper. Res. Soc., 2014

On the computation of all eigenvalues for the eigenvalue complementarity problem.
J. Glob. Optim., 2014

Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem.
INFORMS J. Comput., 2014

Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations.
Comput. Oper. Res., 2014

On an enumerative algorithm for solving eigenvalue complementarity problems.
Comput. Optim. Appl., 2014

Distributed optimal load shedding for disaster recovery in smart electric power grids: a second-order approach.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

2013
Throughput Maximization for Multi-Hop Wireless Networks with Network-Wide Energy Constraint.
IEEE Trans. Wirel. Commun., 2013

An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing.
Transp. Sci., 2013

A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem.
Transp. Sci., 2013

Ideal representations of lexicographic orderings and base-2 expansions of integer variables.
Oper. Res. Lett., 2013

Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality.
J. Glob. Optim., 2013

Aggregate-level demand management in evacuation planning.
Eur. J. Oper. Res., 2013

Tight compact models and comparative analysis for the prize collecting Steiner tree problem.
Discret. Appl. Math., 2013

On generating maximal nondominated Benders cuts.
Ann. Oper. Res., 2013

Configuration of airspace sectors for balancing air traffic controller workload.
Ann. Oper. Res., 2013

A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture.
Ann. Oper. Res., 2013

On traveling path and related problems for a mobile station in a rechargeable sensor network.
Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2013

Bundling mobile base station and wireless energy transfer: Modeling and optimization.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Distributed cross-layer optimization in wireless networks: A second-order approach.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012
Making sensor networks immortal: an energy-renewal approach with wireless power transfer.
IEEE/ACM Trans. Netw., 2012

Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs.
Optim. Lett., 2012

On a fractional minimal cost flow problem on networks.
Optim. Lett., 2012

Joint Flow Routing and Relay Node Assignment in Cooperative Multi-Hop Networks.
IEEE J. Sel. Areas Commun., 2012

Optimal Power Allocation in Multi-Relay MIMO Cooperative Networks: Theory and Algorithms.
IEEE J. Sel. Areas Commun., 2012

Femtocell Base Station Deployment in Commercial Buildings: A Global Optimization Approach.
IEEE J. Sel. Areas Commun., 2012

Minimizing the maximum network flow: models and algorithms with resource synergy considerations.
J. Oper. Res. Soc., 2012

A scenario generation-based lower bounding approach for stochastic scheduling problems.
J. Oper. Res. Soc., 2012

Reduced RLT representations for nonconvex polynomial programming problems.
J. Glob. Optim., 2012

Optimized Rostering of Workforce Subject to Cyclic Requirements.
Informatica (Slovenia), 2012

Hardware-Software Co-design for Reconfigurable Field Programmable Gate Arrays Using Mixed-Integer Programming.
Informatica (Slovenia), 2012

Enhancing RLT-based relaxations for polynomial programming problems via a new class of <i>v</i>-semidefinite cuts.
Comput. Optim. Appl., 2012

The coastal seaspace patrol sector design and allocation problem.
Comput. Manag. Sci., 2012

Network interdiction to minimize the maximum probability of evasion with synergy between applied resources.
Ann. Oper. Res., 2012

On Wireless Network Infrastructure Optimization for Cyber-Physical Systems in Future Smart Buildings.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2012

On renewable sensor networks with wireless energy transfer: The multi-node case.
Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, 2012

A distributed Newton's method for joint multi-hop routing and flow control: Theory and algorithm.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Algorithm design for femtocell base station placement in commercial building environments.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Integrating Slot Exchange, Safety, Capacity, and Equity Mechanisms Within an Airspace Flow Program.
Transp. Sci., 2011

Maximizing Capacity in Multihop Cognitive Radio Networks under the SINR Model.
IEEE Trans. Mob. Comput., 2011

New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem.
Optim. Lett., 2011

Multicast Communications in Multi-Hop Cognitive Radio Networks.
IEEE J. Sel. Areas Commun., 2011

Siting and Sizing of Facilities under Probabilistic Demands.
J. Optim. Theory Appl., 2011

Flexible aircraft fleeting and routing at <i>TunisAir</i>.
J. Oper. Res. Soc., 2011

Set partitioning and packing versus assignment formulations for subassembly matching problems.
J. Oper. Res. Soc., 2011

Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs.
J. Glob. Optim., 2011

Selecting Optimal Alternatives and Risk Reduction Strategies in Decision Trees.
Oper. Res., 2011

A Distributed Newton Approach for Joint Multi-Hop Routing and Flow Control: Theory and Algorithm
CoRR, 2011

Exact approaches for integrated aircraft fleeting and routing at TunisAir.
Comput. Optim. Appl., 2011

On renewable sensor networks with wireless energy transfer.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Optimizing network-coded cooperative communications via joint session grouping and relay node selection.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
On Optimal SINR-Based Scheduling in Multihop Wireless Networks.
IEEE/ACM Trans. Netw., 2010

Models and algorithms for the scheduling of a doubles tennis training tournament.
J. Oper. Res. Soc., 2010

A fractional programming approach for retail category price optimization.
J. Glob. Optim., 2010

Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach.
INFORMS J. Comput., 2010

The Nested Event Tree Model with Application to Combating Terrorism.
INFORMS J. Comput., 2010

A Dynamic Network Interdiction Problem.
Informatica, 2010

Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint.
Electron. Notes Discret. Math., 2010

Algorithmic expedients for the Prize Collecting Steiner Tree Problem.
Discret. Optim., 2010

Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization.
Comput. Optim. Appl., 2010

A mixed-integer mathematical modeling approach to exam timetabling.
Comput. Manag. Sci., 2010

Cooperative Communications in Multi-hop Wireless Networks: Joint Flow Routing and Relay Node Assignment.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Reformulation-Linearization Technique for Global Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Disjunctive Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On path selection and rate allocation for video in wireless mesh networks.
IEEE/ACM Trans. Netw., 2009

On the asymmetric eigenvalue complementarity problem.
Optim. Methods Softw., 2009

Complementary column generation and bounding approaches for set partitioning formulations.
Optim. Lett., 2009

Joint vehicle assembly-routing problems: An integrated modeling and optimization approach.
Networks, 2009

Two-stage stochastic hierarchical multiple risk problems: models and algorithms.
Math. Program., 2009

Two-stage workforce planning under demand fluctuations and uncertainty.
J. Oper. Res. Soc., 2009

Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality.
J. Glob. Optim., 2009

On optimal zero-preserving corrections for inconsistent linear systems.
J. Glob. Optim., 2009

An Optimal Constrained Pruning Strategy for Decision Trees.
INFORMS J. Comput., 2009

A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions.
Discret. Appl. Math., 2009

On performance optimization for multi-carrier MIMO ad hoc networks.
Proceedings of the 10th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2009

Optimal Scheduling in Interference Limited Fading Wireless Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Optimal power allocation for achieving perfect secrecy capacity in MIMO wire-tap channels.
Proceedings of the 43rd Annual Conference on Information Sciences and Systems, 2009

2008
On the capacity of multiuser MIMO networks with interference.
IEEE Trans. Wirel. Commun., 2008

Rate allocation and network lifetime problems for wireless sensor networks.
IEEE/ACM Trans. Netw., 2008

Cross-Layer Optimization for Data Rate Utility Problem in UWB-Based Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2008

Multimedia-Centric Routing for Multiple Description Video in Wireless Mesh Networks.
IEEE Netw., 2008

Second-order cover inequalities.
Math. Program., 2008

Optimal Allocation of Risk-Reduction Resources in Event Trees.
Manag. Sci., 2008

Cross-Layer Optimization for MIMO-Based Wireless Ad Hoc Networks: Routing, Power Allocation, and Bandwidth Allocation.
IEEE J. Sel. Areas Commun., 2008

Spectrum Sharing for Multi-Hop Networking with Cognitive Radios.
IEEE J. Sel. Areas Commun., 2008

A column generation approach for an employee scheduling problem with multiple shifts and work locations.
J. Oper. Res. Soc., 2008

Preface.
J. Glob. Optim., 2008

Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands.
Oper. Res., 2008

An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems.
INFORMS J. Comput., 2008

A quantitative approach for scheduling activities to reduce set-up in multiple machine lines.
Eur. J. Oper. Res., 2008

Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities.
Discret. Optim., 2008

A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints.
Comput. Oper. Res., 2008

The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches.
Comput. Optim. Appl., 2008

A cross-layer approach to end-to-end routing and SINR-based scheduling in multi-hop wireless networks.
Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, 2008

On the Maximum Weighted Sum-Rate of MIMO Gaussian Broadcast Channels.
Proceedings of IEEE International Conference on Communications, 2008

Routing and Power Allocation for MIMO-Based Ad Hoc Networks with Dirty Paper Coding.
Proceedings of IEEE International Conference on Communications, 2008

2007
On joint routing and server selection for MD video streaming in ad hoc networks.
IEEE Trans. Wirel. Commun., 2007

Multicast Communications in <i>Ad Hoc</i> Networks Using Directional Antennas: A Lifetime-Centric Approach.
IEEE Trans. Veh. Technol., 2007

Applying the sequence-pair representation to optimal facility layout designs.
Oper. Res. Lett., 2007

An improved linearization strategy for zero-one quadratic programming problems.
Optim. Lett., 2007

Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.
Optim. Lett., 2007

Cross-Layer Optimized Multipath Routing for Video Communications in Wireless Networks.
IEEE J. Sel. Areas Commun., 2007

An Inverse Reliability-based Approach for Designing under Uncertainty with Application to Robust Piston Design.
J. Glob. Optim., 2007

Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability.
INFORMS J. Comput., 2007

Multiple Shift Scheduling of Hierarchical Workforce with Multiple Work Centers.
Informatica, 2007

A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs.
Int. J. Comput. Sci. Eng., 2007

A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations.
Eur. J. Oper. Res., 2007

Conjugate Gradient Projection Approach for Multi-Antenna Gaussian Broadcast Channels
CoRR, 2007

The eigenvalue complementarity problem.
Comput. Optim. Appl., 2007

RLT: A unified approach for discrete and continuous nonconvex optimization.
Ann. Oper. Res., 2007

Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations.
Ann. Oper. Res., 2007

Cross-Layer Optimization of MIMO-Based Mesh Networks Under Orthogonal Channels.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

Optimal Multipath Routing for Performance Guarantees in Multi-Hop Wireless Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

Conjugate Gradient Projection Approach for MIMO Gaussian Broadcast Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
Routing for concurrent video sessions in ad hoc networks.
IEEE Trans. Veh. Technol., 2006

Optimal base station selection for anycast routing in wireless sensor networks.
IEEE Trans. Veh. Technol., 2006

An Airspace-Planning and Collaborative Decision-Making Model: Part II - Cost Model, Data Considerations, and Computations.
Transp. Sci., 2006

On Routing for Multiple Description Video Over Wireless Ad Hoc Networks.
IEEE Trans. Multim., 2006

The approach-dependent, time-dependent, label-constrained shortest path problem.
Networks, 2006

On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables.
Math. Program., 2006

A polyhedral study of the generalized vertex packing problem.
Math. Program., 2006

Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming.
Math. Program., 2006

Multiple Description Video Multicast in Wireless Ad Hoc Networks.
Mob. Networks Appl., 2006

A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear Programs.
Math. Methods Oper. Res., 2006

Optimal routing for UWB-based sensor networks.
IEEE J. Sel. Areas Commun., 2006

A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints.
J. Glob. Optim., 2006

Airline fleet assignment concepts, models, and algorithms.
Eur. J. Oper. Res., 2006

Mathematical programming models and algorithms for a class-faculty assignment problem.
Eur. J. Oper. Res., 2006

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints.
Discret. Optim., 2006

Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods.
Comput. Optim. Appl., 2006

Optimal rate control for video transport over multi-hop wireless networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Optimization of Multiuser MIMO Networks with Interference.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
Polyhedral Analysis and Algorithms for a Demand-Driven Refleeting Model for Aircraft Assignment.
Transp. Sci., 2005

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints.
Oper. Res. Lett., 2005

On Node Lifetime Problem for Energy-Constrained Wireless Sensor Networks.
Mob. Networks Appl., 2005

A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem.
J. Glob. Optim., 2005

A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem.
J. Glob. Optim., 2005

Partial convexification cuts for 0-1 mixed-integer programs.
Eur. J. Oper. Res., 2005

Interleaving two-phased jobs on a single machine.
Discret. Optim., 2005

Chvatal-Gomory-tier cuts for general integer programs.
Discret. Optim., 2005

A class of web-based facets for the generalized vertex packing problem.
Discret. Appl. Math., 2005

Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints.
Ann. Oper. Res., 2005

A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems.
Ann. Oper. Res., 2005

Prolonging sensor network lifetime with energy provisioning and relay node placement.
Proceedings of the Second Annual IEEE Communications Society Conference on Sensor, 2005

On Base Station Selection for Anycast Flow Routing in Energy-Constrained Wireless Sensor Networks.
Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2005), 2005

Cross-layer optimization for routing data traffic in UWB-based sensor networks.
Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, 2005

Multipath routing for multiple description video in wireless ad hoc networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Online lifetime-centric multicast routing for ad hoc networks with directional antennas.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Routing for multiple concurrent video sessions in wireless ad hoc networks.
Proceedings of IEEE International Conference on Communications, 2005

Joint routing and server selection for multiple description video streaming in ad hoc networks.
Proceedings of IEEE International Conference on Communications, 2005

Nonlinear Programming - Theory and Algorithms, Third Edition.
Wiley, ISBN: 978-0-47178777-8, 2005

2004
On embedding the volume algorithm in a variable target value method.
Oper. Res. Lett., 2004

Rate allocation in wireless sensor networks with network lifetime requirement.
Proceedings of the 5th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2004

On lexicographic max-min node lifetime for wireless sensor networks.
Proceedings of IEEE International Conference on Communications, 2004

2003
An Airspace Planning and Collaborative Decision - Making Model: Part I - Probabilistic Conflicts, Workload, and Equity Considerations.
Transp. Sci., 2003

Time-Dependent, Label-Constrained Shortest Path Problems with Applications.
Transp. Sci., 2003

Foundation-penalty cuts for mixed-integer programs.
Oper. Res. Lett., 2003

A Pseudo-Global Optimization Approach with Application to the Design of Containerships.
J. Glob. Optim., 2003

Enhanced Model Formulations for Optimal Facility Layout.
Oper. Res., 2003

An approach for analyzing foreign direct investment projects with application to China's Tumen River Area development.
Comput. Oper. Res., 2003

2002
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations.
Transp. Sci., 2002

A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse.
J. Glob. Optim., 2002

Enhancing RLT relaxations via a new class of semidefinite cuts.
J. Glob. Optim., 2002

On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems.
Oper. Res., 2002

Global Optimization Procedures for the Capacitated Euclidean and <i>l<sub>p</sub></i> Distance Multifacility Location-Allocation Problems.
Oper. Res., 2002

2001
On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions.
Oper. Res. Lett., 2001

Global optimization of nonconvex factorable programming problems.
Math. Program., 2001

Improving Discrete Model Representations via Symmetry Considerations.
Manag. Sci., 2001

Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality.
J. Glob. Optim., 2001

Convex hull representations of models for computing collisions between multiple bodies.
Eur. J. Oper. Res., 2001

On using exterior penalty approaches for solving linear programming problems.
Comput. Oper. Res., 2001

Limited Memory Space Dilation and Reduction Algorithms.
Comput. Optim. Appl., 2001

2000
National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm.
Transp. Sci., 2000

On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems.
SIAM J. Optim., 2000

A variable target value method for nondifferentiable optimization.
Oper. Res. Lett., 2000

A branch-and-cut algorithm for solving an intraring synchronous optical network design problem.
Networks, 2000

Determining Rail Fleet Sizes for Shipping Automobiles.
Interfaces, 2000

Book Reviews.
Interfaces, 2000

Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting.
INFORMS J. Comput., 2000

A Game Theoretic Analysis of Mechanisms to Induce Regional Technological Cooperation.
Informatica, 2000

New modeling approaches for the design of local access transport area networks.
Eur. J. Oper. Res., 2000

Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations.
Discret. Appl. Math., 2000

1999
Solving Euclidean Distance Multifacility Location Problems Using Conjugate Subgradient and Line-Search Methods.
Comput. Optim. Appl., 1999

1998
A Tactical Decision Support System for Empty Railcar Management.
Transp. Sci., 1998

The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms.
Networks, 1998

Persistency in 0-1 Polynomial Programming.
Math. Oper. Res., 1998

Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents.
J. Glob. Optim., 1998

Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems.
Oper. Res., 1998

An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies.
Comput. Oper. Res., 1998

1997
Low Probability - High Consequence Considerations in Routing Hazardous Material Shipments.
Transp. Sci., 1997

New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems.
Oper. Res. Lett., 1997

Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems.
J. Glob. Optim., 1997

A Global Optimization Approach to a Water Distribution Network Design Problem.
J. Glob. Optim., 1997

Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming.
Comput. Optim. Appl., 1997

1996
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs.
Oper. Res. Lett., 1996

Optimal location of transmitters for micro-cellular radio communication system design.
IEEE J. Sel. Areas Commun., 1996

Tighter Representations for Set Partitioning Problems.
Discret. Appl. Math., 1996

1995
Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes.
SIAM J. Discret. Math., 1995

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope.
Oper. Res. Lett., 1995

A reformulation-convexification approach for solving nonconvex quadratic programming problems.
J. Glob. Optim., 1995

Book review.
J. Glob. Optim., 1995

1994
A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem.
Discret. Appl. Math., 1994

A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems.
Discret. Appl. Math., 1994

Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem.
Ann. Oper. Res., 1994

An enhanced RSM algorithm using gradient-deflection and second-order search strategies.
Proceedings of the 26th conference on Winter simulation, 1994

1993
Mixed-integer bilinear programming problems.
Math. Program., 1993

Finding the closest point to the origin in the convex hull of a discrete set of points.
Comput. Oper. Res., 1993

A Quadratic Partial Assignment and Packing Model and Algorithm for the Airline Gate Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993

Nonlinear Programming - Theory and Algorithms, Second Edition.
Wiley, ISBN: 978-0-471-55793-7, 1993

1992
Variational Problems for Determining Optimal Paths of a Moving Facility.
Transp. Sci., 1992

A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique.
J. Glob. Optim., 1992

A new reformulation-linearization technique for bilinear programming problems.
J. Glob. Optim., 1992

Minisum and minimax paths of a moving facility on a network.
Comput. Oper. Res., 1992

A leader-follower model and analysis for a two-stage network of oligopolies.
Ann. Oper. Res., 1992

1991
On the equivalence between some shortest path algorithms.
Oper. Res. Lett., 1991

Unbalanced, capacitated <i>p</i>-median problems on a chain graph with a continuum of link demands.
Networks, 1991

Capacitated, balanced, sequential location-allocation problems on chains and trees.
Math. Program., 1991

1990
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems.
SIAM J. Discret. Math., 1990

A Two-Phase Decomposition Approach for Electric Utility Capacity Expansion Planning Including Nondispatchable Technologies.
Oper. Res., 1990

Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems.
Oper. Res., 1990

1988
A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands.
Transp. Sci., 1988

NP-Hard, Capacitated, Balanced <i>p</i>-Median Problems on a Chain Graph with a Continuum of Link Demands.
Math. Oper. Res., 1988

A Mathematical Programming Approach to a Nash-Cournot Equilibrium Analysis for a Two-Stage Network of Oligopolies.
Oper. Res., 1988

Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs.
Discret. Appl. Math., 1988

Convergence analysis and algorithmic implications of two dynamic processes toward an oligopolycompetitive fringe equilibrium solution.
Comput. Oper. Res., 1988

1987
Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization.
Math. Program., 1987

A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization.
Oper. Res., 1987

1986
Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons.
Transp. Sci., 1986

Facet inequalities from simple disjunctions in cutting plane theory.
Math. Program., 1986

A class of convergent primal-dual subgradient algorithms for decomposable convex programs.
Math. Program., 1986

A Game Theoretic-Mathematical Programming Analysis of Cooperative Phenomena in Oligopolistic Markets.
Oper. Res., 1986

A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem.
Comput. Oper. Res., 1986

An extreme-point-ranking algorithm for the extreme-point mathematical programming problem.
Comput. Oper. Res., 1986

1985
On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs.
Math. Program., 1985

Sequential location-allocation problems on chains and trees with probabilistic link demands.
Math. Program., 1985

Technical Note - On Generating Cutting Planes from Combinatorial Disjunctions.
Oper. Res., 1985

A branch and bound algorithm for extreme point mathematical programming problems.
Discret. Appl. Math., 1985

A nonlinear hierarchical approach for incorporating solar generation units in electric utility capacity expansion plans.
Comput. Oper. Res., 1985

1984
A Decomposition Algorithm for a Discrete Location-Allocation Problem.
Oper. Res., 1984

A Multiple Leader Stackelberg Model and Analysis.
Oper. Res., 1984

1983
Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations.
Oper. Res., 1983

1982
A property regarding degenerate pivots for linear assignment networks.
Networks, 1982

A mathematical programming approach for determining oligopolistic market equilibrium.
Math. Program., 1982

A finitely convergent procedure for facial disjunctive programs.
Discret. Appl. Math., 1982

1980
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts.
Math. Program., 1980


  Loading...