On the public citation graph

Thek-track assignment problem

https://doi.org/10.1007/bf02238071
0 signed · 23 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.1016/0166-218x(87)90037-0openalex-snapshot
Scheduling jobs with fixed start and end times
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3477339openalex-extracted
Assign-to-Seat: Dynamic Capacity Control for Selling Train Tickets
inferred← citeshttps://doi.org/10.1002/nav.20231openalex-snapshot
Interval scheduling: A survey
inferred← citeshttps://doi.org/10.1006/jagm.1998.1001openalex-snapshot
A Greedy On-Line Algorithm for thek-Track Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-26504-4_29openalex-snapshot
Modeling and Solving the K-Track Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_32openalex-snapshot
Algorithmic Analysis for Ridesharing of Personal Vehicles
inferred← citeshttps://doi.org/10.1007/s10951-005-6363-6openalex-snapshot
The k-Track Assignment Problem on Partial Orders
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00112-5openalex-snapshot
Note on scheduling intervals on-line
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106056openalex-snapshot
Interval scheduling with economies of scale
inferred← citeshttps://doi.org/10.1016/j.dam.2016.08.021openalex-snapshot
Interval scheduling maximizing minimum coverage
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.031openalex-snapshot
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.028openalex-snapshot
Inverse chromatic number problems in interval and permutation graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.019openalex-snapshot
Algorithmic analysis for ridesharing of personal vehicles
inferred← citeshttps://doi.org/10.1057/rpm.2011.37openalex-snapshot
Modeling a hotel room assignment problem
inferred← citeshttps://doi.org/10.1080/0740817x.2014.882036openalex-snapshot
The extraboard operator scheduling and work assignment problem
inferred← citeshttps://doi.org/10.1109/ieem.2007.4419311openalex-snapshot
Study on plan of track lines in marshalling station
inferred← citeshttps://doi.org/10.1142/s0217595910002831openalex-snapshot
DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM
inferred← citeshttps://doi.org/10.1145/2071396.2071404openalex-snapshot
Towards an automatic music arrangement framework using score reduction
inferred← citeshttps://doi.org/10.1287/msom.2023.1188openalex-snapshot
Assign-to-Seat: Dynamic Capacity Control for Selling High-Speed Train Tickets
inferred← citeshttps://doi.org/10.4236/jamp.2017.59140openalex-snapshot
A Dynamic Programming Algorithm for the Ridersharing Problem Restricted with Unique Destination and Zero Detour on Trees
inferred← citeshttps://doi.org/10.70675/392f856cz5e14z4c84za45bz06b027cbc2a6openalex-snapshot
Algorithmes exacts et approchés pour l'ordonnancement des travaux multiressources à intervalles fixes dans des systèmes distribués : approche monocritère et multiagent
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.