MétaCan
Menu
Retour à la cohorte
Enregistrement W4233980123 · doi:10.1287/opre.1110.0994

Contributors

2011· article· en· W4233980123 sur OpenAlex

Pourquoi ce travail est dans la base

Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.

aboutLe titre ou le résumé porte un signal canadien du lexique géographique.
no affAucune affiliation canadienne : ce travail est invisible pour une base fondée sur la seule affiliation.
Aucune affiliation canadienne. Une base fondée sur la seule affiliation (le devis habituel) n'aurait jamais vu ce travail. C'est l'un des travaux qui justifient l'inversion de la base.

Notice bibliographique

RevueOperations Research · 2011
Typearticle
Langueen
DomaineEngineering
ThématiqueVehicle Routing Optimization Methods
Établissements canadiensnon disponible
Organismes subventionnairesnon disponible
Mots-clésComputer scienceMathematical economicsMathematics

Résumé

récupéré en direct d'OpenAlex

Dionne M. Aleman (“ An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application ”) is an assistant professor in the Department of Mechanical and Industrial Engineering at the University of Toronto. She received her Ph.D. in industrial and systems engineering from the University of Florida in Gainesville. Her research interests are medical applications of operations research, specifically radiotherapy treatment optimization and pandemic outbreak planning. She directs the Medical Operations Research Lab (morLAB) at the University of Toronto and is president of the INFORMS Junior Faculty Group and secretary/treasurer of the INFORMS Section on Public Programs and Service Needs; she previously served as Chair of the INFORMS Health Applications Section. Gad Allon (“ The Impact of Delaying the Delay Announcements ”) is an associate professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. Recently he has been studying models of information sharing among firms and customers in service and retail settings. He is also conducting empirical studies to investigate time-based competition in the fast-food industry as well as the factors contributing to emergency department overcrowding. Steve Alpern (“ Patrolling Games ” and “ Find-and-Fetch Search on a Tree ”) is a professor of mathematics at the London School of Economics. He became interested in the field of search games when studying game theory under Oskar Morgenstern, as an undergraduate at Princeton University, and later with Rufus Isaacs. After working on antagonistic versions of these games, he has more recently become interested in versions where the two searchers have the common aim of finding each other as soon as possible (rendezvous). In addition to search games, his current research interests include decentralized matching, and mathematical models in animal behavior. Roberto Baldacci (“ New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem ” and “ An Exact Method for the Capacitated Location-Routing Problem ”) is a researcher in operations research at the Department of Electronics, Computer Science and Systems (DEIS) of the University of Bologna, Italy. His major research interests are in the area of transportation planning, logistics and distribution, and the solution to vehicle routing and scheduling problems over street networks. His research activities are in the theory and applications of mathematical programming. He has worked in the design of new heuristic and exact methods for solving combinatorial problems as routing and location problems. Achal Bassamboo (“ The Impact of Delaying the Delay Announcements ”) is an associate professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. His research interests lie in the areas of service systems, revenue management, and information sharing. His current research involves designing flexible service systems with a focus on capacity planning and effects of parameter uncertainty. He is also studying credibility of information provided by a service provider or a retailer to its customers. Mark Broadie (“ General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm ”) is the Carson Family Professor of Business in the Graduate School of Business, Columbia University. His research focuses on issues in financial engineering, with a particular focus on the design and analysis of efficient Monte Carlo methods for pricing and risk management. Rodolfo A. Catena (“ Rating Customers According to Their Promptness to Adopt New Products ”) is a health-care researcher for the SPHERE Institute. In 2009, he graduated from the University of California, Berkeley, in industrial engineering and operations research. Previously he completed a thesis on the issue of train timetabling in conjunction with the Operations Research Group at the University of Bologna. His research interests include stochastic programming, network optimization, and combinatorial optimization applied to marketing, finance, production, and health-care problems. Xin Chen (“ Integration of Inventory and Pricing Decisions with Costly Price Adjustments ”) is an associate professor at the Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana–Champaign. His research interests include supply chain management, inventory management, and optimization. He is a coauthor of the book The Logic of Logistics (Springer 2005). Youhua (Frank) Chen (“ Integration of Inventory and Pricing Decisions with Costly Price Adjustments ” and “ A Computational Approach for Optimal Joint Inventory-Pricing Control in an Infinite-Horizon Periodic-Review System ”) is an associate professor at the Department of Systems Engineering and Engineering Management, the Chinese University of Hong Kong. His current research is focused on interfaces between operations and marketing, and inventory models with risk considerations. Mabel C. Chou (“ Process Flexibility Revisited: The Graph Expander and Its Applications ”) is an associate professor in the Department of Decision Sciences, NUS Business School, National University of Singapore. Her research interests include production scheduling, logistic and supply chain analysis, and flexibility design and analysis. Geoffrey A. Chua (“ Process Flexibility Revisited: The Graph Expander and Its Applications ”) is an assistant professor in the Division of Information Technology and Operations Management at Nanyang Business School, Nanyang Technological University, Singapore. His research interests include the analysis and design of process flexibility and robust systems, decision making under uncertainty, and supply chain management. Deniz Cicek (“ General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm ”) is a Ph.D. candidate in the Decision, Risk and Operations division of Columbia Business School. His research interests are simulation optimization and its applications. Youyi Feng (“ A Computational Approach for Optimal Joint Inventory-Pricing Control in an Infinite-Horizon Periodic-Review System ”) is a professor of supply chain management at MIT-Zaragoza International Logistics Program, Zaragoza Logistics Center. His current research interests include revenue management, energy trading and value chain management, and carbon emission control and trading strategies. This note is part of several related publications dealing with dynamic pricing problems where inventories can be replenished. Antonio Frangioni (“ Projected Perspective Reformulations with Applications in Design Problems ”) graduated with honors in computer science from the University of Pisa, Italy, in 1992 and earned his Ph.D. in computer science from the same university in 1996. He had been a research associate at the Computer Science Department of the University of Pisa from 1996 to 2004, where he is now an associate professor. His main research interests are in models and algorithms for large-scale continuous and combinatorial optimization problems, using such techniques as decomposition algorithms, interior-point methods, reformulation techniques, and network flow approaches. Claudio Gentile (“ Projected Perspective Reformulations with Applications in Design Problems ”) graduated with honors in computer science from the University of Pisa in 1995 and received the Diploma of the Scuola Normale Superiore of Pisa. In 2000 he finished his Ph.D. studies in operations research at University “La Sapienza” of Rome. Since 1999 he has been a researcher at the Institute of System Analysis and Computer Science “Antonio Ruberti” of the Italian National Research Council (IASI-CNR). His main research interests are in combinatorial optimization, polyhedral theory for linear and nonlinear integer programming problems, interior point methods, and network flow problems. Hamid R. Ghaffari (“ An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application ”) is a Ph.D. candidate in the Department of Mechanical and Industrial Engineering at the University of Toronto. His research interests are medical applications of operations research, specifically radiotherapy treatment optimization. K. Giesecke (“ Exact Simulation of Point Processes with Stochastic Intensities ”) is assistant professor of management science and engineering at Stanford University. His research and teaching interests are in applied probability, Monte Carlo simulation, and financial engineering. Enrico Grande (“ Projected Perspective Reformulations with Applications in Design Problems ”) graduated cum laude in industrial engineering from the University of Rome “Tor Vergata” in 2005. In 2010 he finished his Ph.D. in operations research at University “La Sapienza” of Rome. His main research interests are in mixed integer nonlinear programming and in flows over time problems. Robert G. Haight (“ Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks ”) is a research forester with the U.S. Forest Service Northern Research Station in St. Paul, Minnesota. He studies the economics of public programs for wildlife protection, metropolitan open space protection, wildfire management, and invasive species management. Dorit S. Hochbaum (“ Rating Customers According to Their Promptness to Adopt New Products ”) is a full professor and Chancellor Chair at the University of California at Berkeley, Department of Industrial Engineerin

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,001
score de la tête « metaresearch » (Gemma)0,000
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesCharge utile insuffisante (le modèle a refusé de juger)
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Simulation ou modélisation · Signal consensuel: Simulation ou modélisation
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,682
Score d'incertitude au seuil1,000

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0010,000
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,000
Études des sciences et des technologies0,0000,000
Communication savante0,0000,000
Science ouverte0,0000,000
Intégrité de la recherche0,0000,000
Charge utile insuffisante (le modèle a refusé de juger)0,0010,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,167
Tête enseignante GPT0,389
Écart entre enseignants0,222 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle