Subhash C. Sarin
Orcid: 0000-0002-1744-2281Affiliations:
- Virginia Polytechnic Institute and State University
According to our database1,
Subhash C. Sarin
authored at least 42 papers
between 2001 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
2025
0
1
2
3
4
5
1
2
1
1
2
1
2
3
3
1
1
2
2
1
1
1
3
4
1
1
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on ise.vt.edu
-
on orcid.org
On csauthors.net:
Bibliography
2025
Nested benders decomposition for a deterministic biomass feedstock logistics problem.
J. Glob. Optim., January, 2025
2024
J. Glob. Optim., June, 2024
Modeling and analysis of a new production methodology for achieving mass customization.
Int. J. Prod. Res., January, 2024
2023
J. Sched., August, 2023
2022
A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions.
Informatica, 2022
2021
Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective.
INFORMS J. Comput., 2021
Eur. J. Oper. Res., 2021
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021
2020
2019
A branch-and-price approach for a biomass feedstock logistics supply chain design problem.
IISE Trans., 2019
Price competition between high and low brand products considering coordination strategy.
Comput. Ind. Eng., 2019
2018
J. Oper. Res. Soc., 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
Biomass feedstock supply chain design - a taxonomic review and a decomposition-based methodology.
Int. J. Prod. Res., 2018
2017
Lot streaming in the presence of learning in sublot-attached setup times and processing times.
Int. J. Prod. Res., 2017
Joint-advertising for collection of returned products in a closed-loop supply chain under uncertain environment.
Comput. Ind. Eng., 2017
2016
J. Glob. Optim., 2016
2015
J. Oper. Res. Soc., 2015
2014
J. Sched., 2014
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations.
Comput. Oper. Res., 2014
Proceedings of the Essays in Production, 2014
2013
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
2012
A scenario generation-based lower bounding approach for stochastic scheduling problems.
J. Oper. Res. Soc., 2012
A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times.
Comput. Oper. Res., 2012
2011
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem.
Optim. Lett., 2011
2010
A university-timetabling problem and its solution using Benders' partitioning - a case study.
J. Sched., 2010
2009
Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability.
J. Comb. Optim., 2009
2008
Int. J. Intell. Syst. Technol. Appl., 2008
Allocation of work to the stations of an assembly line with buffers between stations and three general learning patterns.
Int. J. Intell. Syst. Technol. Appl., 2008
Eur. J. Oper. Res., 2008
2007
Proceedings of the Algorithmic Aspects in Information and Management, 2007
2006
Eur. J. Oper. Res., 2006
Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle.
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
2005
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints.
Oper. Res. Lett., 2005
A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005
2004
J. Comb. Optim., 2004
2003
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups.
J. Comb. Optim., 2003
2001
Eur. J. Oper. Res., 2001
Optimal Solutions for the Single Batch, Flow Shop, Lot-streaming Problem with Equal Sublots.
Decis. Sci., 2001