Results 131 to 140 of about 1,258,420 (289)

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

open access: yesNetworks, 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   +6 more
wiley   +1 more source

Simultaneous Network Design With Restricted Link Usage

open access: yesNetworks, EarlyView.
ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura   +3 more
wiley   +1 more source

Distinguishability of causal structures under latent confounding and selection

open access: yesJournal of Causal Inference
Statistical relationships in observed data can arise for several different reasons: the observed variables may be causally related, they may share a latent common cause, or there may be selection bias.
Carey Ryan   +3 more
doaj   +1 more source

On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)

open access: yesNetworks, EarlyView.
ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs   +2 more
wiley   +1 more source

The electromagnetic transient simulation acceleration algorithm based on delay mitigation of dynamic critical paths

open access: yesEnergy Informatics
The task scheduling problem based on directed acyclic graphs (DAGs) has been proven to be NP-complete in general cases or under certain restrictions.
Qi Guo   +7 more
doaj   +1 more source

Designing Nonprofit Success: A Systematic Review of Board Design Choices and Organizational Performance

open access: yesNonprofit Management and Leadership, EarlyView.
ABSTRACT I synthesize 78 studies from leading nonprofit and public administration journals to explain why research on board design choices, board effectiveness, and organizational performance yields inconsistent findings. The analysis reveals that empirical contradictions stem primarily from theoretical misalignment and measurement diversity rather ...
Ashraf Haque
wiley   +1 more source

Novel tetronamides derived from mucobromic acid: synthesis, structural elucidation, DFT calculations and phytotoxic activity

open access: yesPest Management Science, EarlyView.
The acyclic mucobromic acid, activated by (1S)‐(+)‐10‐camphorsulfonic acid, afforded the chiral compound 1b, precursor for aza‐Michael addition/elimination on the butenolide yielding tetronamides 2b‐7b. Their relative SRSR configuration was confirmed by the spectrometric methods, DFT calculation and statistical methods.
Kamylla CF Faria   +2 more
wiley   +1 more source

Why theory matters for causal inference? Rethinking endogeneity in entrepreneurship research

open access: yesStrategic Entrepreneurship Journal, EarlyView.
Abstract Endogeneity in entrepreneurship research is often treated as a statistical complication addressable through advanced econometric tools. This commentary argues that such an approach overlooks a deeper issue: endogeneity is conceptual before it is statistical.
Daniel Tzabbar
wiley   +1 more source

Unleashing the value of a “scientific approach” to entrepreneurship: Building an empirical research agenda

open access: yesStrategic Entrepreneurship Journal, EarlyView.
Abstract Research Summary In this manuscript, we argue that the Entrepreneurs‐as‐Scientists (E‐a‐S) research program requires a fundamental shift from predominantly conceptual development toward an empirical agenda to achieve its normative goal: developing a scalable algorithm that improves entrepreneurial learning and value creation.
Arnaldo Camuffo   +2 more
wiley   +1 more source

Edge Weight Reduction Problems in Directed, Acyclic Graphs

open access: yes, 1997
Let G be a weighted, directed, acyclic graph in which each edge weight is not a static quantity, but can be reduced for a certain cost. In this paper we consider the problem of determining which edges to reduce so that the length of the longest paths is ...
Susanne Hambrusch, Hung-yi Tu
core  

Home - About - Disclaimer - Privacy