Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Raymond Nilsen

dblp:02/4555 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 67% Coding theory · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design
difference triangle sets		 0.011991
Application of linear programming to the optimal difference triangle set problem · IEEE Trans. Inf. Theory 1991
Mathematical optimization
integer programming		 0.011991
Application of linear programming to the optimal difference triangle set problem · IEEE Trans. Inf. Theory 1991
Mathematical optimization
linear programming relaxation		 0.011991
Application of linear programming to the optimal difference triangle set problem · IEEE Trans. Inf. Theory 1991

Methods — techniques the papers use, named apart from their topics

valid inequalities · 0.0branch-and-bound · 0.0
YearPublicationVenuePosition
1991 Application of linear programming to the optimal difference triangle set problem
abstract
Difference triangle sets have a number of applications in telecommunications. The authors describe a linear programming model for finding improved lower bounds on the size of such sets. Two integer linear programming formulations for finding minimal difference triangle sets are presented. The linear programming relaxation of the second formulation is strengthened with a family of valid inequalities and solved to yield improved lower bounds. Numerical results for selected difference triangle sets are given.>
Ralph Lorentzen, Raymond Nilsen
 IEEE Trans. Inf. Theory2