Petri net representation and reachability analysis of 0--1 integer linear programming problems (Q2293169)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7164595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Petri net representation and reachability analysis of 0--1 integer linear programming problems |
scientific article; zbMATH DE number 7164595 |
Statements
Petri net representation and reachability analysis of 0--1 integer linear programming problems (English)
0 references
7 February 2020
0 references
discrete event systems
0 references
Petri net
0 references
0--1 integer linear programming problem
0 references
optimal transition firing sequence problems
0 references
reachability analysis
0 references
AGV systems
0 references
0 references
0 references
0 references
0.8325371146202087
0 references
0.8164336681365967
0 references
0.7885735034942627
0 references
0.7786336541175842
0 references
0.756257951259613
0 references
