Results 241 to 250 of about 165,252 (290)

Tractable but Hard to Approximate: The Bi‐Objective Minimum s$$ s $$‐t$$ t $$‐Cut Problem With Binary Capacities

open access: yesNetworks, EarlyView.
ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann   +4 more
wiley   +1 more source

An Exact Method for Reliable Shortest Path Problems With Correlation

open access: yesNetworks, EarlyView.
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva   +3 more
wiley   +1 more source

Solid Particle Erosion and Predictive Modeling of Epoxy Composites Reinforced With Diatom Frustules

open access: yesPolymer Composites, EarlyView.
Schematic representation of the solid particle erosion process and predictive modeling workflow for diatom frustule‐reinforced epoxy composites, illustrating the test setup, erosion response curve, and filler‐matrix interaction. ABSTRACT This study examines the solid particle erosion wear behavior of epoxy composites reinforced with 5–20 wt% calcined ...
Elif Gültürk   +4 more
wiley   +1 more source

Optimization by decoded quantum interferometry. [PDF]

open access: yesNature
Jordan SP   +8 more
europepmc   +1 more source

Runtime Monitoring of Static Fairness Properties

open access: yes
Henzinger TA   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy