A mixed integer linear programming formulation of the maximum betweenness problem (Q976481): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051624054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An MILP for scheduling problems in an FMS with one vehicle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Betweenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minmax regret approach to the critical path method with task interval times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic ordering is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Betweenness Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible MILP model for multiple-shift workforce planning under annualized hours / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to cyclic ordering of 2D orientations using ternary relation algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3400313 / rank
 
Normal rank

Latest revision as of 22:45, 2 July 2024

scientific article
Language Label Description Also known as
English
A mixed integer linear programming formulation of the maximum betweenness problem
scientific article

    Statements

    Identifiers