Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing (Q2104772): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11128-022-03670-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: PuLP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cbc / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4297997184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum bridge analytics. I: A tutorial on formulating and using QUBO models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained binary models of the travelling salesman problem variants for quantum optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Optimization Models for Train Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling trains as a blocking parallel-machine job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for scheduling trains in a railway network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to modeling train scheduling problems as job-shop problems with blocking constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial unconstrained binary optimisation -- part 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058826 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11128-022-03670-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:52, 17 December 2024

scientific article
Language Label Description Also known as
English
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
scientific article

    Statements

    Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2022
    0 references
    higher-order binary optimization
    0 references
    railway rescheduling
    0 references
    railway rerouting
    0 references
    quantum-classical hybrid procedure
    0 references
    D-wave annealer
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references