中文
相关论文

相关论文: Profit-Maximizing Parcel Locker Location Problem u…

200 篇论文

This paper introduces a new hierarchical facility location model with three levels: first-level facilities which manufacture different products, second-level facilities which act as warehouses and a third-level consisting of the clients who…

Recent years have witnessed the rise of many successful e-commerce marketplace platforms like the Amazon marketplace, AirBnB, Uber/Lyft, and Upwork, where a central platform mediates economic transactions between buyers and sellers.…

计算机科学与博弈论 · 计算机科学 2018-03-01 Reza Alijani , Siddhartha Banerjee , Sreenivas Gollapudi , Kostas Kollias , Kamesh Munagala

We study Facility Location with Matching, a Facility Location problem where, given additional information about which pair of clients is compatible to be matched, we need to match as many clients as possible and assign each matched client…

数据结构与算法 · 计算机科学 2026-02-24 Fateme Abbasi , Martin Böhm , Jarosław Byrka , Matin Mohammadi , Yongho Shin

Storage systems account for a major portion of the total cost of ownership (TCO) of warehouse-scale computers, and thus have a major impact on the overall system's efficiency. Machine learning (ML)-based methods for solving key problems in…

分布式、并行与集群计算 · 计算机科学 2025-04-22 Chenxi Yang , Yan Li , Martin Maas , Mustafa Uysal , Ubaid Ullah Hafeez , Arif Merchant , Richard McDougall

We consider the following two deterministic inventory optimization problems over a finite planning horizon $T$ with non-stationary demands. (a) Submodular Joint Replenishment Problem: This involves multiple item types and a single retailer…

数据结构与算法 · 计算机科学 2015-04-27 Viswanath Nagarajan , Cong Shi

Motivated by the phenomenon that companies introduce new products to keep abreast with customers' rapidly changing tastes, we consider a novel online learning setting where a profit-maximizing seller needs to learn customers' preferences…

机器学习 · 计算机科学 2019-04-30 Junyu Cao , Wei Sun

We study the dynamic joint assortment selection and positioning problem, where the attraction of each product depends on both its intrinsic appeal and its display position under a Multinomial Logit (MNL) choice framework. Our study ranges…

机器学习 · 计算机科学 2026-05-19 Xi Chen , Shibo Dai , Jiameng Lyu , Yuan Zhou

Due to numerous applications in retail and (online) advertising the problem of assortment selection has been widely studied under many combinations of discrete choice models and feasibility constraints. In many situations, however, an…

数据结构与算法 · 计算机科学 2023-08-11 Vineet Goyal , Salal Humair , Orestis Papadigenopoulos , Assaf Zeevi

Location Routing is a fundamental planning problem in logistics, in which strategic location decisions on the placement of facilities (depots, distribution centers, warehouses etc.) are taken based on accurate estimates of operational…

离散数学 · 计算机科学 2021-08-06 Felipe Carrasco Heine , Antonia Demleitner , Jannik Matuschke

In this paper, we revisit parameter estimation for multinomial logit (MNL), nested logit (NL), and tree-nested logit (TNL) models through the framework of convex conic optimization. Traditional approaches typically solve the maximum…

计量经济学 · 经济学 2025-09-03 Hoang Giang Pham , Tien Mai , Minh Ha Hoang

Facility Location problems ask to place facilities in a way that optimizes a given objective function so as to provide a service to all clients. These are one of the most well-studied optimization problems spanning many research areas such…

数据结构与算法 · 计算机科学 2020-07-01 Christine Markarian , Abdul-Nasser Kassar , Manal Yunis

Motivated by modern-day applications such as Attended Home Delivery and Preference-based Group Scheduling, where decision makers wish to steer a large number of customers toward choosing the exact same alternative, we introduce a novel…

最优化与控制 · 数学 2025-02-13 Omar El Housni , Marouane Ibn Brahim , Danny Segev

A retailer is purchasing goods in bundles from suppliers and then selling these goods in bundles to customers; her goal is to maximize profit, which is the revenue obtained from selling goods minus the cost of purchasing those goods. In…

数据结构与算法 · 计算机科学 2025-08-01 Yossi Azar , Niv Buchbinder , Roie Levin , Or Vardi

The facility location problems (FLPs) are a typical class of NP-hard combinatorial optimization problems, which are widely seen in the supply chain and logistics. Many mathematical and heuristic algorithms have been developed for optimizing…

机器学习 · 计算机科学 2022-10-28 Shiqing Liu , Xueming Yan , Yaochu Jin

We study a joint facility location and cost planning problem in a competitive market under random utility maximization (RUM) models. The objective is to locate new facilities and make decisions on the costs (or budgets) to spend on the new…

最优化与控制 · 数学 2024-01-17 Ngan Ha Duong , Tien Thanh Dam , Thuy Anh Ta , Tien Mai

In this paper the capacitated hub location problem is formulated by a minimax regret model, which takes into account uncertain setup cost and demand. We focus on hub location with multiple allocations as a strategic problem requiring one…

数据结构与算法 · 计算机科学 2017-09-19 Iman Kazemian , Samin Aref

Motivated by applications in retail, online advertising, and cultural markets, this paper studies how to find the optimal assortment and positioning of products subject to a capacity constraint. We prove that the optimal assortment and…

数据结构与算法 · 计算机科学 2021-10-01 Andres Abeliuk , Gerardo Berbeglia , Manuel Cebrian , Pascal Van Hentenryck

The bilevel facility location problem (BO-FLP) is one of the core optimization problems behind the design of many decentralized industrial systems, e.g., supply chain systems where a supplier constructs some critical facilities and then…

最优化与控制 · 数学 2026-03-24 Haitao Hu , Jing Li , Jiafu Tang , Bo Zeng

Logistics network is expected that opened facilities work continuously for a long time horizon without any failure, but in real world problems, facilities may face disruptions. This paper studies a reliable joint inventory location problem…

数据结构与算法 · 计算机科学 2017-11-28 Elham Taghizadeh , Mostafa Abedzadeh , Mostafa Setak

We consider a dynamic assortment selection problem, where in every round the retailer offers a subset (assortment) of $N$ substitutable products to a consumer, who selects one of these products according to a multinomial logit (MNL) choice…

机器学习 · 计算机科学 2018-07-03 Shipra Agrawal , Vashist Avadhanula , Vineet Goyal , Assaf Zeevi