Results 61 to 70 of about 37,139 (224)
Handling software upgradeability problems with MILP solvers
, 2010 Upgradeability problems are a critical issue in modern operating systems. The problem consists in finding the "best" solution according to some criteria, to install, remove or upgrade packages in a given installation.
Chris Tucker +13 more
core +2 more sources
MILP formulations for scheduling lightpaths under periodic traffic [PDF]
2009 11th International Conference on Transparent Optical Networks, 2009 This paper addresses offline virtual topology design in transparent optical networks under given periodic traffic. We call this planning problem “ Scheduled Virtual Topology Design” . Two problem variants are considered: for a network based on non-reconfigurable equipment and for a network based on reconfigurable equipment.
Aparicio Pardo, Ramón +4 more
openaire +3 more sources
Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach
Naval Research Logistics (NRL), EarlyView.ABSTRACT Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting
Yishay Shapira, Mor Kaspi
wiley +1 more source
SNAP: Stateful Network-Wide Abstractions for Packet Processing
, 2016 Early programming languages for software-defined networking (SDN) were built on top of the simple match-action paradigm offered by OpenFlow 1.0. However, emerging hardware and software switches offer much more sophisticated support for persistent state ...
Arashloo, Mina Tahmasbi +4 more
core +1 more source
EVA-MILP: Towards Standardized Evaluation of MILP Instance Generation
Mixed-Integer Linear Programming (MILP) is fundamental to solving complex decision-making problems. The proliferation of MILP instance generation methods, driven by machine learning's demand for diverse optimization datasets and the limitations of static benchmarks, has significantly outpaced standardized evaluation techniques.
Luo, Yidong +4 more
openaire +2 more sources
Ordered Median Traveling Salesman Problem
Networks, EarlyView.ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source
Progress in mathematical programming solvers from 2001 to 2020
EURO Journal on Computational Optimization, 2022 This study investigates the progress made in lp and milp solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today.
Thorsten Koch +3 more
doaj +1 more source
Empirical Bounds on Linear Regions of Deep Rectifier Networks
, 2019 We can compare the expressiveness of neural networks that use rectified linear units (ReLUs) by the number of linear regions, which reflect the number of pieces of the piecewise linear functions modeled by such networks.
Ramalingam, Srikumar, Serra, Thiago
core +1 more source
Shaping Decision Models for Stochastic Dynamic Optimization Problems via Reinforcement Learning
Networks, EarlyView.ABSTRACT With rising customer expectations and increasing computational potential, many transport, manufacturing, and production operations face real‐time decision making in stochastic dynamic environments. Decision makers must find and adapt complex plans that are effective now but also flexible with respect to future developments.
Florentin D. Hildebrandt +3 more
wiley +1 more source
Solving Mixed Integer Bilinear Problems Using MILP Formulations [PDF]
SIAM Journal on Optimization, 2013 In this paper, we examine a mixed integer linear programming reformulation for mixed integer bilinear problems where each bilinearterm involves the product of a nonnegative integer variable and a nonnegative continuous variable. This reformulation is obtained by first replacing a general integer variable with its binary expansion and then using ...
Gupte, Akshay +3 more
openaire +2 more sources