On the public citation graph

SPREAD: A Balancing Constraint Based on Statistics

0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-45193-8_30openalex-snapshot

Fast Bound Consistency for the Global Cardinality Constraint

inferredcites →https://doi.org/10.1007/978-3-540-45193-8_41openalex-snapshot

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint

inferredcites →https://doi.org/10.1007/b13743openalex-snapshot

Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings

inferredcites →https://doi.org/10.1007/s10601-005-0552-yopenalex-snapshot

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470612309.ch4openalex-snapshot

Constraint Propagation and Implementation

inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_3openalex-snapshot

Global Constraints: A Survey

inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_6openalex-snapshot

Over-Constrained Problems

inferred← citeshttps://doi.org/10.1007/978-3-031-95976-9_10openalex-snapshot

Acquiring and Selecting Implied Constraints with an Application to the BinSeq and Partition Global Constraints

inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_15openalex-snapshot

The Balance Constraint Family

inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_32openalex-snapshot

CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_25openalex-snapshot

Randomness as a Constraint

inferred← citeshttps://doi.org/10.1007/978-3-319-33954-2_21openalex-snapshot

Balancing Nursing Workload by Constraint Programming

inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_21openalex-snapshot

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_42openalex-snapshot

Availability Optimization in Cloud-Based In-Memory Data Grids

inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_3openalex-snapshot

MDDs are Efficient Modeling Tools: An Application to Some Statistical Constraints

inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_19openalex-snapshot

The Deviation Constraint

inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_44openalex-snapshot

Bound-Consistent Deviation Constraint

inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_19openalex-snapshot

Scalable Load Balancing in Nurse to Patient Assignment Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_20openalex-snapshot

Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource

inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_16openalex-snapshot

The Weighted Average Constraint

inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_42openalex-snapshot

Focus : A Constraint for Concentrating High Costs

inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_40openalex-snapshot

A Parametric Propagator for Discretely Convex Pairs of Sum Constraints

inferred← citeshttps://doi.org/10.1007/s10288-021-00486-xopenalex-snapshot

Measures of balance in combinatorial optimization

inferred← citeshttps://doi.org/10.1007/s10479-010-0683-4openalex-snapshot

Global propagation of side constraints for solving over-constrained problems

inferred← citeshttps://doi.org/10.1007/s10601-006-9011-7openalex-snapshot

Models for Global Constraint Applications

inferred← citeshttps://doi.org/10.1007/s10601-015-9233-7openalex-snapshot

Three generalizations of the FOCUS constraint

inferred← citeshttps://doi.org/10.1007/s10601-016-9238-xopenalex-snapshot

ℚ-bounds consistency for the spread constraint with variable mean

inferred← citeshttps://doi.org/10.1007/s10732-011-9158-2openalex-snapshot

The balanced academic curriculum problem revisited

inferred← citeshttps://doi.org/10.1007/s13675-013-0018-8openalex-snapshot

Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments

inferred← citeshttps://doi.org/10.1016/j.artint.2008.10.010openalex-snapshot

Computing leximin-optimal solutions in constraint networks

inferred← citeshttps://doi.org/10.1016/j.artint.2016.08.006openalex-snapshot

A parametric propagator for pairs of Sum constraints with a discrete convexity property

inferred← citeshttps://doi.org/10.1109/ictai.2010.68openalex-snapshot

The Ordered Distribute Constraint

inferred← citeshttps://doi.org/10.1287/ijoc.2015.0654openalex-snapshot

Achieving Domain Consistency and Counting Solutions for Dispersion Constraints

inferred← citeshttps://doi.org/10.1287/ijoc.2018.0855openalex-snapshot

Enriching Solutions to Combinatorial Problems via Solution Engineering

inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10433openalex-snapshot

Counting-Based Search for Constraint Optimization Problems

inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-777openalex-snapshot

Statistical Constraints

inferred← citeshttps://doi.org/10.4230/lipics.cp.2023.26openalex-snapshot

Guiding Backtrack Search by Tracking Variables During Constraint Propagation

inferred← citeshttps://doi.org/10.48550/arxiv.1304.5970openalex-snapshot

Three Generalizations of the FOCUS Constraint

inferred← citeshttps://doi.org/10.48550/arxiv.1401.7463openalex-snapshot

Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation

inferred← citeshttps://doi.org/10.48550/arxiv.1611.08942openalex-snapshot

The BIN_COUNTS Constraint: Filtering and Applications

inferred← citeshttps://doi.org/10.48550/arxiv.1708.01829openalex-snapshot

Declarative Statistics

inferred← citeshttps://doi.org/10.52502/ijitas.v2i4.13openalex-snapshot

An algorithm to calculates an allocation maximizing the leximin order on the utility profiles of the agents

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.