EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Consecutive-ones"
Narrow search

Narrow search

Year of publication
Subject
All
Binary matrices 1 Classification 1 Combinatorial optimisation 1 Consecutive One’s Property 1 Consecutive ones property 1 Consecutive-ones 1 Consent rules 1 Group decision-making 1 Group identification 1 Gruppenentscheidung 1 Heuristics 1 Integer linear programming 1 Interval graphs 1 Mathematical programming 1 Mathematische Optimierung 1 PQ-Trees 1 Partition refinement 1 Polynomial-time solvability 1 Robinsonian dissimilarities 1 Scheduling 1 Seriation 1 Theorie 1 Theory 1
more ... less ...
Online availability
All
Undetermined 3
Type of publication
All
Article 3
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
Undetermined 2 English 1
Author
All
Chakhlevitch, Konstantin 1 Dimitrov, Dinko 1 Fortin, Dominique 1 Glass, Celia A. 1 Préa, Pascal 1 Shakhlevich, Natalia V. 1 Yang, Yongjie 1
more ... less ...
Published in...
All
European Journal of Operational Research 1 Journal of Classification 1 Mathematical social sciences 1
Source
All
RePEc 2 ECONIS (ZBW) 1
Showing 1 - 3 of 3
Cover Image
Group control for consent rules with consecutive qualifications
Yang, Yongjie; Dimitrov, Dinko - In: Mathematical social sciences 121 (2023), pp. 1-7
Persistent link: https://www.econbiz.de/10014226889
Saved in:
Cover Image
An Optimal Algorithm To Recognize Robinsonian Dissimilarities
Préa, Pascal; Fortin, Dominique - In: Journal of Classification 31 (2014) 3, pp. 351-385
A dissimilarity D on a finite set S is said to be Robinsonian if S can be totally ordered in such a way that, for every i j k, D (i, j) ≤ D (i, k) and D (j, k) ≤ D (i, k). Intuitively, D is Robinsonian if S can be represented by points on a line. Recognizing Robinsonian dissimilarities has...
Persistent link: https://www.econbiz.de/10011152084
Saved in:
Cover Image
Minimising the number of gap-zeros in binary matrices
Chakhlevitch, Konstantin; Glass, Celia A.; Shakhlevich, … - In: European Journal of Operational Research 229 (2013) 1, pp. 48-58
We study a problem of minimising the total number of zeros in the gaps between blocks of consecutive ones in the … columns of a binary matrix by permuting its rows. The problem is referred to as the Consecutive Ones Matrix Augmentation …
Persistent link: https://www.econbiz.de/10010664718
Saved in:
A service of the
zbw
FAQ-Assistent (beta)
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...