中文
相关论文

相关论文: A MIP Backend for the IDP System

200 篇论文

This paper presents the integration of constraint propagation and dual proof analysis in an exact, roundoff-error-free MIP solver. The authors employ safe rounding methods to ensure that all results remain provably correct, while…

最优化与控制 · 数学 2024-03-21 Sander Borst , Leon Eifler , Ambros Gleixner

Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this…

机器人学 · 计算机科学 2007-05-23 Matthew Earl , Raffaello D'Andrea

Integer programming (IP) is central to many combinatorial optimization tasks but remains challenging due to its NP-hard nature. A practical way to improve IP solvers is to manually design acceleration cuts, i.e., inequalities that speed up…

人工智能 · 计算机科学 2026-02-16 Milad Yazdani , Mahdi Mostajabdaveh , Samin Aref , Zirui Zhou

The P4 language has become the dominant choice for programming the reconfigurable match-action table based programmable switches. V1Model architecture is the most widely available realization of this paradigm. The open-source compiler…

网络与互联网体系结构 · 计算机科学 2022-08-30 Debobroto Das Robin , Javed I. Khan

Many probabilistic inference tasks involve summations over exponentially large sets. Recently, it has been shown that these problems can be reduced to solving a polynomial number of MAP inference queries for a model augmented with randomly…

人工智能 · 计算机科学 2013-09-27 Stefano Ermon , Carla P. Gomes , Ashish Sabharwal , Bart Selman

Over the past few decades, neuroscience experiments have become increasingly complex and naturalistic. Experimental design has in turn become more challenging, as experiments must conform to an ever-increasing diversity of design…

神经元与认知 · 定量生物学 2020-12-07 Storm Slivkoff , Jack L. Gallant

A variant of the well-known Knapsack Problem is studied in this paper, where pairs of items are conflicting, and cannot be selected at the same time. This configures a set of hard constraints. The problem, which can be used to model real…

最优化与控制 · 数学 2025-06-05 Roberto Montemanni , Derek H. Smith

Meta-Interpretive Learning (MIL) learns logic programs from examples by instantiating meta-rules, which is implemented by the Metagol system based on Prolog. Viewing MIL-problems as combinatorial search problems, they can alternatively be…

计算机科学中的逻辑 · 计算机科学 2018-05-02 Tobias Kaminski , Thomas Eiter , Katsumi Inoue

To be responsive to dynamically changing real-world environments, an intelligent agent needs to perform complex sequential decision-making tasks that are often guided by commonsense knowledge. The previous work on this line of research led…

人工智能 · 计算机科学 2019-08-01 Yi Wang , Shiqi Zhang , Joohyung Lee

This paper presents the Julia package CCOpt, built on top of the interior-point solver MadNLP. CCOpt implements a suite of algorithms for Mathematical Programs with Complementarity Constraints (MPCCs). The solver additionally comes with…

最优化与控制 · 数学 2026-04-23 Anton Pozharskiy , François Pacaud , Moritz Diehl , Armin Nurkanović

pyscreener is a Python library that seeks to alleviate the challenges of large-scale structure-based design using computational docking. It provides a simple and uniform interface that is agnostic to the backend docking engine with which to…

定量方法 · 定量生物学 2022-05-05 David E. Graff , Connor W. Coley

We present a solver for Mixed Integer Programs (MIP) developed for the MIP competition 2022. Given the 10 minutes bound on the computational time established by the rules of the competition, our method focuses on finding a feasible solution…

Finding the most probable (MAP) model in SRL frameworks such as Markov logic and Problog can, in principle, be solved by encoding the problem as a `grounded-out' mixed integer program (MIP). However, useful first-order structure disappears…

人工智能 · 计算机科学 2015-07-14 James Cussens

In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of jobs whose starting times are guaranteed. The problem was…

最优化与控制 · 数学 2021-06-24 Pascale Bendotti , Philippe Chrétienne , Pierre Fouilhoux , Adèle Pass-Lanneau

This paper explores the use of Answer Set Programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) It shows how one can formulate DCOPs as logic programs;…

多智能体系统 · 计算机科学 2017-05-12 Tiep Le , Tran Cao Son , Enrico Pontelli , William Yeoh

In recent years, several frameworks and systems have been proposed that extend Inductive Logic Programming (ILP) to the Answer Set Programming (ASP) paradigm. In ILP, examples must all be explained by a hypothesis together with a given…

人工智能 · 计算机科学 2016-08-08 Mark Law , Alessandra Russo , Krysia Broda

The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in…

The unprecedented growth of data volumes has caused traditional approaches to computing to be re-evaluated. This has started a transition towards the use of very large-scale clusters of commodity hardware and has given rise to the…

分布式、并行与集群计算 · 计算机科学 2022-03-03 K. F. D. Rietveld , H. A. G. Wijshoff

Mixed-integer programming (MIP) research is both mathematically sophisticated and engineering-intensive: testing an algorithmic hypothesis within a branch-and-cut solver requires substantial implementation, debugging, tuning, and…

人工智能 · 计算机科学 2026-05-12 Liding Xu , Yugeng Zhou , Sebastian Pokutta

Many high-performing machine learning models are not interpretable. As they are increasingly used in decision scenarios that can critically affect individuals, it is necessary to develop tools to better understand their outputs. Popular…

人工智能 · 计算机科学 2023-05-30 Laura State , Salvatore Ruggieri , Franco Turini