Results 261 to 270 of about 138,756 (354)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. [PDF]

Algorithmica
Eiben E, Ganian R, Kanj I, Ordyniak S, Szeider S.   +4 more
europepmc   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source

Open filters and measurable cardinals. [PDF]

Arch Math Log
Bardyla S, Šupina J, Zdomskyy L.
europepmc   +1 more source

Interdiction Models and Heuristics for Graph Propagation

Networks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

Assessing the Influence of Cardinality Constraints on the Simultaneous Optimization of Truss Sizing, Shape, and Topology. [PDF]

Materials (Basel)
Petrović N, Kostić N, Marjanović N, Nikolić RR, Ulewicz R.   +4 more
europepmc   +1 more source

An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem

Networks, EarlyView.
ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu, Massimo Di Francesco, Enrico Gorgone, Ishwar Murthy   +3 more
wiley   +1 more source

Extracting preference relations from data: Clustering with transitive centroids. [PDF]

Behav Res Methods
de Chiusole D, Stefanutti L, Brancaccio A.   +2 more
europepmc   +1 more source

Integrating indigenous crops in agroforestry systems: Lesser yam and teak mixed systems are more profitable than monocultures in Indonesia

PLANTS, PEOPLE, PLANET, EarlyView.
Major staple crops are often introduced and cultivated in monocultures. Yams are staple crops native to the majority of low‐ and middle‐income countries and can provide an alternative to introduced staple crops. We showed that lesser yams cultivated together with teak trees (planted at the border of the farm) are more profitable than lesser yam ...
Budiadi, Sawitri, Enggal Primananda, Aqmal Nur Jihad, Marco Campera, Rika Bela Rahmawati   +5 more
wiley   +1 more source

Reinforcement learning in densely recurrent biological networks. [PDF]

iScience
Churchland MW, Garcia-Ojalvo J.
europepmc   +1 more source

Open‐land‐derived agroforestry and effects of abandonment of management of the main crop on ecosystem services and woody plant diversity

PLANTS, PEOPLE, PLANET, EarlyView.
Tropical forests are rapidly declining. One promising strategy to reverse the loss of tropical forest is the establishment of agroforestry on open land. We combined interviews with biodiversity surveys to learn general lessons from success and nonsuccess stories of the establishment of open‐land‐derived coffee agroforests in one of the world's ...
Lucas M. Fonzaghi, Kristoffer Hylander, Thiago S. de Melo, Ayco J. M. Tack   +3 more
wiley   +1 more source