Anup K. Sen

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 2

Top Topics

Combinatorial Auctions

Winner Determination

Completion Times

Top Venues

Decis. Support Syst.

Comput. Ind. Eng.

Publications

Anup K. Sen, Amitava Bagchi, Soumyakanti Chakraborty
Designing information feedback for bidders in multi-item multi-unit combinatorial auctions. Decis. Support Syst. 130 (2020)
Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi
Addressing the valuation problem in multi-round combinatorial auctions. Inf. Syst. Frontiers 17 (5) (2015)
Sivaraman Ramanathan, Avinash Kasinathan, Anup K. Sen
Incremental solutions to online multi-unit combinatorial auctions for information feedback. ASONAM (2014)
Viswanathan Kodaganallur, Anup K. Sen, Subrata Mitra
Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times. Comput. Ind. Eng. 67 (2014)
Anup K. Sen, Amitava Bagchi
Providing Information Feedback to Bidders in Online Multi-unit Combinatorial Auctions. AMCIS (2012)
Akhil Kumar, Anup K. Sen, Meda H. Sundari, Amitava Bagchi
Semantic Notions of Weakly Correct AND/XOR Business Workflows Based on Partial Synchronization. IEEE SCC (2011)
Viswanathan Kodaganallur, Anup K. Sen
Greedy by Chance - Stochastic Greedy Algorithms. ICAS (2010)
Hema S. Meda, Anup K. Sen, Amitava Bagchi
On Detecting Data Flow Errors in Workflows. ACM J. Data Inf. Qual. 2 (1) (2010)
Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi
Designing Proxy Bidders for Online Combinatorial Auctions. HICSS (2009)
Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi
Revaluation of Bundles by Bidders in Combinatorial Auctions. HICSS (2009)
Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi
Bidder Valuation of Bundles in Combinatorial Auctions. HICSS (2008)
D. Anurag, Anup K. Sen
The Chronon Based Model for Temporal Databases. DASFAA (2008)
Raj Jog Singh, Anup K. Sen
Exploring local search in winner determination problem. Inf. Technol. Manag. 9 (2) (2008)
Arindam Mukherjee, Anup K. Sen, Amitava Bagchi
The representation, analysis and verification of business processes: a metagraph-based approach. Inf. Technol. Manag. 8 (1) (2007)
Anup K. Sen, Amitava Bagchi, Weixiong Zhang
Average-case analysis of best-first search in two representative directed acyclic graphs. Artif. Intell. 155 (1-2) (2004)
Anup K. Sen, Amitava Bagchi, Weixiong Zhang
An Average-Case Analysis of Graph Search. AAAI/IAAI (2002)
Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya
Searching networks with unrestricted edge costs. IEEE Trans. Syst. Man Cybern. Part A 31 (6) (2001)
Sakib A. Mondal, Anup K. Sen
Single machine weighted earliness-tardiness penalty problem with a common due date. Comput. Oper. Res. 28 (7) (2001)
Sakib A. Mondal, Anup K. Sen
TCBB Scheme: Applications to Single Machine Job Sequencing Problems. AAAI/IAAI (2000)
Sakib A. Mondal, Anup K. Sen
An improved precedence rule for single machine sequencing problems with quadratic penalty. Eur. J. Oper. Res. 125 (2) (2000)
Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya
Geometric bipartitioning problem and its applications to VLSI. VLSI Design (1996)
Anup K. Sen, Amitava Bagchi
Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems. Artif. Intell. 86 (1) (1996)
Anup K. Sen, Amitava Bagchi, Ramkumar Ramaswamy
Searching graphs with A*: applications to job sequencing. IEEE Trans. Syst. Man Cybern. Part A 26 (1) (1996)
Anup K. Sen, Amitava Bagchi
Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems. IJCAI (1993)
R. Ramaswamy, Anup K. Sen
Single Machine Scheduling as a Graph Search Problem with Path-Dependent Arc Costs. ECAI (1992)
Anup K. Sen, Amitava Bagchi, Bani K. Sinha
Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines. IJCAI (1991)
Anup K. Sen, Amitava Bagchi
Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. IJCAI (1989)
Amitava Bagchi, Anup K. Sen
Heuristic search in general tree structures: an average case analysis. ACM Conference on Computer Science (1986)