Results 131 to 140 of about 4,246 (261)

Image Partition Regularity over the Gaussian Integers

, 2017
Dibyendu De, Subhajit Jana
openalex   +1 more source

The Weak Core, Partition‐Based Universal Stability, and Their Risk Associations Through A Partial Order

Naval Research Logistics (NRL), EarlyView.
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

Explaining unforeseen congruence relationships between PEND and POND partitions via an Atkin-Lehner involution. [PDF]

Ramanujan J
Sellers JA, Smoot NA.
europepmc   +1 more source

Non-embeddability of standard contexts of lattices of integer partitions

, 2021
Mike Behrisch, Edith Vargas-García
openalex   +1 more source

A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints

Networks, EarlyView.
ABSTRACT This article studies a vehicle routing problem involving a fleet of heavy‐duty vehicles and pickup‐and‐delivery requests for crude items that are both heavy and high‐temperature. The objective is to route the fleet in such a way that maximizes resource efficiency and operational efficiency while simultaneously avoiding thermal overload of any ...
Biljana Roljić, Yuan Chen
wiley   +1 more source

A MacMahon analysis view of cylindric partitions. [PDF]

Ramanujan J
Li R, Uncu AK.
europepmc   +1 more source

Arrow relations in lattices of integer partitions

Asma'a Almazaydeh, Mike Behrisch, Edith Vargas-García, Andreas Wachtel   +3 more
openalex   +1 more source

Staircases to Analytic Sum-Sides for Many New Integer Partition Identities of Rogers-Ramanujan Type [PDF]

, 2019
Shashank Kanade, Matthew C. Russell
openalex   +1 more source

Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems

Networks, EarlyView.
ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum, Timo Gschwind, Stefan Irnich   +2 more
wiley   +1 more source

Model-based partition scheduling of integrated modular avionics systems using genetic algorithm. [PDF]

Sci Rep
Chen J, Zhai Z, Han P, Huang M.
europepmc   +1 more source