Results 71 to 80 of about 5,146,266 (215)
Optimizing Household Waste Recycling Centre Network Reorganization in Hampshire
Networks, EarlyView.ABSTRACT Local councils across the UK are facing sustained financial pressures, and Household Waste Recycling Centres (HWRCs) are being increasingly considered for closure to reduce expenditure. In 2024, Hampshire County Council, which operates the largest HWRC network in the UK, proposed closing either five or twelve existing sites.
Montree Jaidee +4 more
wiley +1 more source
Resource redeployment as an entry advantage in resource‐poor settings
Strategic Management Journal, EarlyView.Abstract Research Summary Scarcity of productive factors poses a challenge for firms entering underdeveloped regions. We theorize that incumbent firms can overcome scarcity of skilled human capital in local labor markets by redeploying workers from existing units.
Jasmina Chauvin +2 more
wiley +1 more source
Assessing second‐price auctions for parcel exchanges in last‐mile logistics
International Transactions in Operational Research, EarlyView.Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley +1 more source
Naval Research Logistics (NRL), Volume 73, Issue 5, Page 743-763, August 2026.ABSTRACT This paper examines the impacts of Volume‐Based Procurement (VBP) policies on pharmaceutical supply chains, with a focus on the strategic behaviors of manufacturers. VBP aims to reduce costs and stabilize supplies by centralizing procurement through competition based on volumes and prices.
Nani Zhou, Tong Wang, Guohua Wan
wiley +1 more source
A simple combinatorial algorithm for submodular function minimization [PDF]
, 2009 This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(n6EO log nM) [O (n superscript 6 E O log nM)] time, where n is the cardinality of the ground set, M is the ...
Satoru Iwata +3 more
core +1 more source
Naval Research Logistics (NRL), Volume 73, Issue 5, Page 810-835, August 2026.ABSTRACT We are concerned with the stability of a transferable‐utility cooperative (TU) game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings. This principle of consensual blocking, as well as the traditional core‐defining one of unilateral blocking and one straddling in ...
Jian Yang
wiley +1 more source
Balanced Submodular Flows [PDF]
, 2023 This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edges. A min-max formula is given to the problem and an algorithm is presented
Szabó, Eszter, Jüttner, Alpár
core +1 more source
Optimal Selling Mechanisms With Endogenous Seller Outside Offers
International Economic Review, Volume 67, Issue 3, Page 875-891, August 2026.ABSTRACT We examine a two‐stage selling mechanism design problem, where the buyer makes her report and the seller endogenously decides his effort (hidden investment) to generate a possibly better outside offer. The optimal mechanism shows that the seller's effort depends on the reported value of the buyer; a higher value lowers the seller's incentive ...
Xiaogang Che +3 more
wiley +1 more source
A Fully Combinatorial Algorithm for Submodular Function Minimization [PDF]
, 2002 This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function ...
Satoru Iwata, Iwata, Satoru
core +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source