Results 51 to 60 of about 1,222,002 (199)
Last‐minute coordination: Adapting to demand to support last‐mile operations
Journal of Operations Management, Volume 71, Issue 2, Page 176-194, March 2025.Abstract In the highly competitive e‐commerce industry, customer‐facing warehouses are crucial as the “order penetration points” for e‐commerce last‐mile operations. This research examines how warehouses use last‐minute coordination, an unstructured mechanism, to ensure sufficient inventory at the order penetration points. Previous research has focused
Kedong Chen +3 more
wiley +1 more source
Calibration‐Free Single‐Frame Super‐Resolution Fluorescence Microscopy
Laser &Photonics Reviews, EarlyView.A deep learning framework reconstructs super‐resolved fluorescence images from a single dense camera frame, without any prior calibration or knowledge of the microscope. Trained solely on synthetic data, it generalizes across imaging setups and conditions.
Anežka Dostálová +3 more
wiley +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Mathematical Methods in the Applied Sciences, EarlyView.The goal of this work is to look at how a nonlinear model describes hematopoiesis and its complexities utilizing commonly used techniques with historical and material links. Based on time delay, the Mackey–Glass model is explored in two instances. To offer a range, the relevance of the parameter impacting stability (bifurcation) is recorded.
Shuai Zhang +5 more
wiley +1 more source
A new decomposition theorem for Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
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 +6 more
wiley +1 more source
Decomposing Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no old hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
Networks, 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
A structure theorem for graphs with no cycle with a unique chord and its consequences [PDF]
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition.
Nicolas Trotignon, Kristina Vuskovic
core