Similar Search Results

Profit-maximizing parcel locker location problem under threshold Luce model

Lin, Yunhui; Wang, Yuan; Lee, Loo Hay; Chew, Ek Peng - In: Transportation research / E : an international journal 157 (2022), pp. 1-17

Persistent link: https://www.econbiz.de/10013169884

Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule

Lin, Yun Hui; Tian, Qingyun - In: European journal of operational research : EJOR 293 (2021) 1, pp. 109-119

Persistent link: https://www.econbiz.de/10012502456

An integrated supply-demand approach to solving optimal relocations in station-based carsharing systems

Jian, Sisi; Rey, David; Dixit, Vinayak - In: Networks and spatial economics : a journal of … 19 (2019) 2, pp. 611-632

Persistent link: https://www.econbiz.de/10012219781

Modeling, simulation and analysis of a securities settlement system : the case of Central Securities Depository of Mexico

Muñoz, David F.; Palacios, Arturo; Lascuráin Morhán, … - In: Journal of economics, finance & administrative science 17 (2012) 33, pp. 48-59

, clearing, settlement and transfer of securities. In this article, we report the modeling, simulation and analysis of a new … and clearing of operations was used. The performance of the new SSS was evaluated by performing experiments using a … between clearing cycles and also under a new set of rules for pre-settlement operations. The results presented may be used by …

Persistent link: https://www.econbiz.de/10011872001

Centralized clearing mechanisms in financial networks : a programming approach

Csóka, Péter; Herings, Peter Jean-Jacques - 2022

We consider financial networks where agents are linked to each other with financial contracts. A centralized clearing … lattice structure, leading to the existence of a least and a greatest clearing payment matrix. Previous research has shown how … decentralized clearing selects the least clearing payment matrix. We present a centralized approach towards clearing in order to …

Persistent link: https://www.econbiz.de/10013173929

Centralized Clearing Mechanisms in Financial Networks : A Programming Approach

Csóka, Péter; Herings, P. Jean-Jacques - 2022

Persistent link: https://www.econbiz.de/10013294101

A numerical study of the logit network pricing problem

Gilbert, François; Marcotte, Patrice; Savard, Gilles - In: Transportation science : a journal of the Institute for … 49 (2015) 3, pp. 706-719

Persistent link: https://www.econbiz.de/10011338618

Envelope theorems for non-smooth and non-concave optimization

Clausen, Andrew; Strub, Carlo - 2012 - Revised version, April 2012

We study general dynamic programming problems with continuous and discrete choices and general constraints. The value functions may have kinks arising (1) at indifference points between discrete choices and (2) at constraint boundaries. Nevertheless, we establish a general envelope theorem:...

Persistent link: https://www.econbiz.de/10009763436

Convex optimization for bundle size pricing problem

Li, Xiaobo; Sun, Hailong; Teo, Chung-Piaw - In: Management science : journal of the Institute for … 68 (2022) 2, pp. 1095-1106

Persistent link: https://www.econbiz.de/10012878844

A divide and conquer algorithm for exploiting policy function monotonicity

Gordon, Grey; Qiu, Shi - In: Quantitative economics : QE ; journal of the … 9 (2018) 2, pp. 521-540

A divide and conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To solve a discrete problem with n states and n choices, the algorithm requires at most nlog2(n)+5n objective function evaluations. In contrast, existing methods for nonconcave problems require...

Persistent link: https://www.econbiz.de/10011994407

1
2
3
4
5
6
7
8
9
10
Next
Last