Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 119 for “"Integer Linear Programming (ILP)"”.

  1. Zero-One Integer Linear Programming for program synthesis

    … key goals. In this thesis, we describe how 0-1 Integer Linear Programming (ILP) can be utilized for program synthesis and code reuse, by discussing its employment in two recent applications.

    texas Repository record for Zero-One Integer Linear Programming for program synthesis (opens in a new tab)

  2. Polynomial Timed Reductions to Solve Computer Security Problems in Access Control, Ethereum Smart Contract, Cloud VM Scheduling, and Logic Locking.

    … reduced to: Model Checking (PSPACE-Complete) and Integer Linear Programming (ILP) (NP-Complete). The PSPACE-Complete problems are: Safety Analysis of Administrative Temporal Role Based Access Control (ATRBAC) Policies, and Safety Analysis of Ethereum Smart Contracts. The NP-Complete problems are: …

    waterloo Repository record for Polynomial Timed Reductions to Solve Computer Security Problems in Access Control, Ethereum Smart Contract, Cloud VM Scheduling, and Logic Locking. (opens in a new tab)

  3. Μοντελοποίηση συμπεριφοράς κυττάρων μέσω ανάλυσης σημάτων

    … andusing regular optimization formulations (Integer Linear Programming (ILP) and Non Linear Programming(NLP) formulations) cross reference them with high throughput phosphoproteomic data to constructpredictive models of the signaling mechanisms of the interrogated cell type

    greece Repository record for Μοντελοποίηση συμπεριφοράς κυττάρων μέσω ανάλυσης σημάτων (opens in a new tab)

  4. Multi-layer palletization of multi-size boxes for 2 1/2D and 3D problems

    … models are proposed in the thesis. Model 1 is an Integer Linear Programming (ILP) model dealing with boxes with different lengths and widths but same height. Model 2 provides systematic procedures for 3D palletization problems by combining the ILP Model 1 and rules of thumb. Model 3 employs a …

    concordia Download PDF for Multi-layer palletization of multi-size boxes for 2 1/2D and 3D problems (opens in a new tab)

  5. The Persistent Robot Charging Problem for Long-Duration Autonomy

    … periodic recharging of multiple robots. A novel Integer Linear Programming (ILP) model is proposed to calculate the optimal initial conditions (partial charge) for individual robots, leading to the minimal utilization of charging stations. This formulation was further generalized to maximize the …

    tamu Repository record for The Persistent Robot Charging Problem for Long-Duration Autonomy (opens in a new tab)

  6. Satisfying war-time fuel requirements with a minimal tanker complement

    … This thesis couples a schedule generator and an integer linear programming (ILP) model to determine the minimum number of tankers to satisfy war-time POL requirements. Solving a realistic scenario provided by J4-MOB (spanning 75 days with 92 available tankers), the ILP selects 19 tankers, …

    nps Repository record for Satisfying war-time fuel requirements with a minimal tanker complement (opens in a new tab)

  7. Initial detailed routing algorithms

    … independent weighted set (MWIS) and utilizes integer linear programming (ILP) as a solver. The implementation of the proposed initial detailed routing flow also includes an implementation of multiple-source and multiple-target A* for terminal andnet connection with adjustable rules and …

    brazil-ufrgs Repository record for Initial detailed routing algorithms (opens in a new tab)

  8. Large-Scale Modeling and Optimization of Routing, Modulation and Spectrum Assignment Problems in Optical Networks

    … configurations. The proposed models are Integer Linear Programs (ILPs) with an exponential number of configuration variables. Therefore, we have developed nested column generation algorithms to exactly solve both problems. Furthermore, Lagrangian Relaxation is used to compute valid upper …

    concordia Download PDF for Large-Scale Modeling and Optimization of Routing, Modulation and Spectrum Assignment Problems in Optical Networks (opens in a new tab)

  9. Hibridização de heurísticas, com programação inteira e mineração de dados, para a solução de duas variantes do problema do caixeiro viajante

    … which combine a state-of-the-art heuristic with integer linear programming (ILP) and data mining. For the PCTSP, a separation procedure is proposed for the cut-sets constraints of a literature’s formulation, a hybrid heuristic that combines GRASP and RVND with PLI, and a new set of instances. In …

    brazil-uerj Repository record for Hibridização de heurísticas, com programação inteira e mineração de dados, para a solução de duas variantes do problema do caixeiro viajante (opens in a new tab)

  10. SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM

    … We show that the compressed problem leads to an Integer Linear Programming (ILP) of reduced dimensionality that can be solved very efficiently using off-the-shelf ILP solvers. Numerical experiments on small-scale, large-scale and benchmark networks are used to evaluate the performance of our …

    cornell Repository record for SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM (opens in a new tab)

  11. Integer Linear Programming Applied to Production Planning

    … This thesis explores the application of Integer Linear Programming (ILP) to an extended version of the JSSP, intro ducing new constraints and utilizing a heuristic when solving the problem. In this work, we present our mathematical formulation for the extended job-shop schedul ing …

    chalmers Repository record for Integer Linear Programming Applied to Production Planning (opens in a new tab)

  12. CHANNEL ASSIGNMENT IN MOBILE RADIO NETWORKS

    … IN MOBILE RADIO NETWORKS, USING A MATHEMATICAL PROGRAMMING APPROACH. THE FIXED CHANNEL ASSIGNMENT (FCA) PROBLEM IS FORMULATED AS AN INTEGER LINEAR PROGRAMMING (ILP) PROBLEM, WITH COMPATIBILITY AND REQUIREMENT CONSTRAINTS. THE PROPOSED FORMULATION IS GENERAL AND FLEXIBLE AND HAS BEEN EXTENDED FOR …

    greece Repository record for CHANNEL ASSIGNMENT IN MOBILE RADIO NETWORKS (opens in a new tab)

  13. Towards Optimization of Dispatching Schemes for Autonomous Electric Vehicle Applications

    … assignment. We formulate the problem as an Integer Linear Programming (ILP) model and propose an efficient heuristic algorithm based on Dynamic Programming (DP) for large-scale systems. Our algorithm outperforms greedy-based algorithms by reducing evacuation time through extensive …

    buffalo Repository record for Towards Optimization of Dispatching Schemes for Autonomous Electric Vehicle Applications (opens in a new tab)

  14. Quantum State Tomography - Optimizing and Scheduling Quantum State Tomography Experiments with Graph Coloring Heuristics

    … (DSATUR), Recursive Largest First (RLF), Integer Linear Programming (ILP), Graph Neural Networks (GNNs), Spectral Clustering (SC), and a range of hybrid methods that aim to balance solution optimality with computational efficiency. Our results demonstrate that the graph coloring heuristic …

    chalmers Repository record for Quantum State Tomography - Optimizing and Scheduling Quantum State Tomography Experiments with Graph Coloring Heuristics (opens in a new tab)

  15. Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures

    … and routing problem. In particular, a integer linear programming (ILP) optimization and a greedy heuristic meth- ods try to maximize the requests acceptance rate while minimizing costs and implementing trac engineering (TE) load-balancing. Next, these schemes are expanded to perform …

    usf Repository record for Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures (opens in a new tab)

  16. Design and Operations of Satellite Constellations for Complex Regional Coverage

    … on the model, this dissertation formulates an integer linear programming (ILP) problem that designs an optimal constellation pattern for complex spatiotemporally-varying coverage requirements. The third chapter examines the problem of reconfiguring satellite constellations for efficient …

    gatech Repository record for Design and Operations of Satellite Constellations for Complex Regional Coverage (opens in a new tab)

  17. Effective Provisioning in Multi-Interface Multi-Channel Wireless Mesh Networks

    … (IA), and Channel Assignment (CA) scheme using Integer Linear Programming (ILP) for both static and dynamic traffic, aiming to maximize the overall throughput considering bandwidth and latency requirements of requests. We use the Gurobi solver to implement the models and conduct a series of …

    concordia Download PDF for Effective Provisioning in Multi-Interface Multi-Channel Wireless Mesh Networks (opens in a new tab)

  18. Simultaneous SNV calling and Phylogenetic Inference for Single-cell Sequencing Data

    … on a new method that I developed, called scVILP, that jointly detects mutations in individual cells and reconstructs a “perfect phylogeny” of the cells (a phylogeny on which every site in the genomes mutates at most once). The method employs a novel Integer Linear Programming (ILP) …

    rice Repository record for Simultaneous SNV calling and Phylogenetic Inference for Single-cell Sequencing Data (opens in a new tab)

  19. Automata-Theoretic Approaches to Planning in Robotics: Combinatorial Filter Minimization, Planning to Chronicle, Temporal Logic Planning With Soft Specifications, and Sensor Selection for Detecting Deviations From a Planned Itinerary

    … solvable in polynomial time, and propose several integer linear programming (ILP) formulations of FM and FPM. Then, we consider a problem, planning to chronicle, in which a robot is tasked with observing an uncertain time-extended process to produce a ‘chronicle’ of occurrent events that meets a …

    south-carolina Repository record for Automata-Theoretic Approaches to Planning in Robotics: Combinatorial Filter Minimization, Planning to Chronicle, Temporal Logic Planning With Soft Specifications, and Sensor Selection for Detecting Deviations From a Planned Itinerary (opens in a new tab)

Page 1 of 6