Pages that link to "Item:Q2386204"

The following pages link to Set covering with almost consecutive ones property (Q2386204):

Displaying 11 items.

• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
• A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
• Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
• Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
• Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
• Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
• Polynomial-time local-improvement algorithm for consecutive block minimization (Q2345864) (← links)
• Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
• Minimum power partial multi-cover on a line (Q2661770) (← links)
• A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)