Anup K. Sen

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