Showing 1 - 3 results of 3 for search 'Mixed-integer quadratically-constraints programming', query time: 0.14s Refine Results
  1. 1

    TSP solution using an exact model based on the branch flow formulation and automatic cases generation via the Julia software by Oscar Danilo Montoya, Walter Gil-González, Luis Fernando Grisales-Noreña, Rubén Iván Bolaños, Jorge Ardila-Rey

    Published 2024-12-01
    “…This research proposes an efficient mixed-integer linear programming (MILP) model based on the branch flow formulation which prevents the formation of sub-tours during the solution process and guarantees valid optimal routes. …”
    Get full text
    Article
  2. 2

    Joint Optimal Train Rescheduling and Passenger Flow Control for Speed Limit and High-Demand Scenarios of Urban Rail Transits by Jianjun Yuan, Xiaoqun Zhao, Pengzi Chu

    Published 2023-01-01
    “…With the goal of maximizing the number of passengers served and minimizing total train delay, a nonlinear optimization model is constructed by taking the train operation-related requirements and passenger flow control-related indicators as constraints, and the model is reformulated to a mixed-integer programming (MIP) model with quadratic constraints, which can be solved by the Gurobi solver. …”
    Get full text
    Article
  3. 3

    MILP/MIQCP-Based Fully Automatic Method of Searching for Differential-Linear Distinguishers for SIMON-Like Ciphers by Yanyan Zhou, Senpeng Wang, Bin Hu

    Published 2024-01-01
    “…At CT-RSA 2023, Bellini et al. introduced continuous difference propagations of XOR, rotation, and modulo-addition operations and proposed a fully automatic method using Mixed-Integer Linear Programing (MILP) and Mixed-Integer Quadratic Constraint Programing (MIQCP) techniques to search for DL distinguishers of Addition-Rotation-XOR (ARX) ciphers. …”
    Get full text
    Article