Results 291 to 300 of about 603,661 (358)

Assortment Planning in Omnichannel Retailing Under Product Returns and Showcase Capacity

Naval Research Logistics (NRL), EarlyView.
ABSTRACT We investigate the assortment planning decisions of a retailer that operates an online sales channel and a brick‐and‐mortar store. We explicitly investigate the impact of product returns, which is a norm in modern retailing and a factor for lost profit.
Amin Aslani, Osman Alp
wiley   +1 more source

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations

Networks, EarlyView.
ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin, Sergiy Butenko, Mykyta Makovenko, Petar Momcilovic, Oleg A. Prokopyev   +4 more
wiley   +1 more source

New heuristics for phylogeny estimation under the balanced minimum evolution criterion. [PDF]

Bioinformatics
Catanzaro D, Dehaybe H, Pesenti R.
europepmc   +1 more source

Stability of Interdiction Strategies in Quickest Flow Networks

Networks, EarlyView.
ABSTRACT Many, if not all, societies have experienced natural disasters, public protests, traffic congestion, and the smuggling of dangerous goods, among other similar events. Such decision‐making and managerial problems can be studied using a game‐theoretic approach on specific networks.
Shahram Morowati‐Shalilvand, Hamid Afshari, Mohamad Y. Jaber   +2 more
wiley   +1 more source

An optimization protocol for MRI examination resource allocation based on demand forecasting and linear programming. [PDF]

Sci Rep
Zhou Z, Zhou H, Qiao Y, Gao Z, Yang Y.
europepmc   +1 more source

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method

Networks, EarlyView.
ABSTRACT The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset.
Nour ElHouda Tellache, Roberto Baldacci
wiley   +1 more source

Exact Methods for the Split Delivery Vehicle Routing Problem With Two‐Dimensional Loading Constraints

Networks, EarlyView.
ABSTRACT The Split Delivery Vehicle Routing Problem with Two‐dimensional Loading Constraints (2L‐SDVRP) integrates vehicle routing, split delivery, and two‐dimensional packing constraints. In the 2L‐SDVRP, customers can be served by multiple vehicles, and their demands consist of different two‐dimensional rectangular items that must be packed in the ...
Kamyla Maria Ferreira, Pedro Munari, Thiago Alves de Queiroz, Claudia Archetti, Reinaldo Morabito   +4 more
wiley   +1 more source

Minimum‐Peak‐Cost Flows Over Time

Networks, EarlyView.
ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt, Timo Gersing, Corinna Mathwieser, Sabrina Schmitz, Sophia Wrede   +7 more
wiley   +1 more source

Large-area OLED substrate printing path planning method based on multi-head GAT imitation learning to solve partitioned integer programming. [PDF]

Sci Rep
Xiong J, Chen J, Li Y, Yue X, Fu Y, Yin Z.   +5 more
europepmc   +1 more source