A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem
[article]
2022
arXiv
pre-print
Preserved Fulltext
Therefore, we propose an efficient Hamiltonian Reduction method that allows quantum processors to solve large BP instances encountered in LEO systems. ...
formulated as clique cover/graph coloring problems. ...
ACKNOWLEDGEMENT This work has been supported by the Luxembourg National Research Fund (FNR) under the project FlexSAT (C19/IS/13696663) and the project MegaLEO (C20/IS/14767486). ...
arXiv:2210.06042v1
fatcat:vurq7rvl4fft5oodjo5f7dgtpy
Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Large-scale LP problems from industry usually contain much redundancy that severely hurts the efficiency and reliability of solving LPs, making presolve (i.e., the problem simplification module) one of ...
Furthermore, we optimize the hard-coded presolve routines in LP solvers by extracting rules from learned policies for simple and efficient deployment to Huawei's supply chain. ...
the Fundamental Research Funds for the Central Universities grant WK3490000004. ...
arXiv:2310.11845v1
fatcat:br4fetnx6bcipnpz7p7wvrwupu
Novel Presolving Techniques For The Connected Facility Location Problem
2012
Conference on Computer Science and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Besides transferring existing techniques designed for the facility location problem, the Steiner tree problem and the group Steiner tree problem, specific new reduction methods are introduced. ...
Additionally, we propose an efficient self-adaptive presolving strategy based on test dependencies and test impacts respectively. ...
For certain instances no further methods need to be applied since the techniques used for presolving completely reduced them to trivial ones and therefore solves it to optimality. ...
dblp:conf/fedcsis/Tomazic12
fatcat:ax7qt7fs75athi3ngqntoaajb4
SCIP: solving constraint integer programs
2009
Mathematical Programming Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs), which is free for academic and non-commercial use and can be downloaded in source code. ...
To illustrate the performance and flexibility of SCIP, we apply it to two different problem classes. ...
Acknowledgments I thank the referees of this paper for their thorough reviews. Their suggestions helped significantly to improve the quality of the paper. ...
doi:10.1007/s12532-008-0001-1
fatcat:elsjugcawndjvlt2lf3e5vgtbq
Optimal Perimeter Guarding with Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We perform structural and algorithmic studies of significantly generalized versions of the optimal perimeter guarding (OPG) problem. ...
Nevertheless, we develop fairly scalable pseudo-polynomial time algorithms for practical, fixed-parameter subcase of OPG_LR; we also develop pseudo-polynomial time algorithm for general OPG_MC and polynomial ...
With the study of OPG [1] for homogeneous and heterogeneous cases, some preliminary understanding has been obtained on how to approach complex 1D guarding problems. ...
arXiv:1912.08591v1
fatcat:33qy44my3fce3lyc5em2b22vfi
Optimal design of compact and functionally contiguous conservation management areas
2016
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Compactness and landscape connectivity are essential properties for effective functioning of conservation reserves. ...
Benning, Georgia, which serves as a safe refuge for this 'at risk' species. ...
Acknowledgments This research was partially supported by the ERDC-CERL Project no. W81EWF-7204-6330, CREES Project no. ILLU 05-0361, and National Natural Science Foundation of China (71202096). ...
doi:10.1016/j.ejor.2015.12.005
fatcat:ftft74xznbfbnk5rr7tzp2jlp4
Mathematics in the Supply Chain
2004
Oberwolfach Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These methods and concepts cover a wide spectrum, ranging from integer programming and dynamic programming methods through approximation algorithms to stochastic optimization methods. ...
As each objective is considered, we maintain a current presolved model, a set of fixings on the original and presolved models, and current basic solutions for the original and presolved models. ...
doi:10.4171/owr/2004/19
fatcat:ja4ckgdronag5m3v4tv3mq55ey
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
2021
Mathematical Programming Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For the first time, these sets were compiled using a data-driven selection process supported by the solution of a sequence of mixed integer optimization problems, which encode requirements on diversity ...
and balancedness with respect to instance features and performance data. ...
as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. ...
doi:10.1007/s12532-020-00194-3
fatcat:btzgkrsmpvao7l4m4ydlwbzvru
A DG-IMEX method for two-moment neutrino transport: Nonlinear solvers for neutrino-matter coupling
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For each approach, the resulting systems are solved with Anderson-accelerated fixed-point iteration and Newton's method. ...
Numerical results suggest that the nested Anderson-accelerated fixed-point solver is more efficient than other tested solvers for solving implicit nonlinear systems with energy coupling neutrino-matter ...
The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or ...
arXiv:2102.02186v1
fatcat:z3maditflfc4nakmprojz3jaay
Integer-Programming Software Systems
2005
Annals of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We review the major algorithmic components of state-of-the-art solvers and discuss the options available to users for adjusting the behavior of these solvers when default settings do not achieve the desired ...
We conclude with a discussion of model characteristics and substructures that pose challenges for integer-programming software systems and a perspective on features we may expect to see in these systems ...
.), and James Tebboth (Dash Optimization) for their help and to two anonymous referees for their valuable suggestions for improving the original version of the paper.
Notes ...
doi:10.1007/s10479-005-3968-2
fatcat:xk4ujqdtvjgflg3uvthbd35ype
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
problem that is hard in theory can be solved efficiently in practice. ...
backdoors more frequently and more efficiently. ...
method made more progress; we count the number of instances for which each a method achieved a smaller gap (higher is better); and (iii) instances that are solved by exactly one of the two methods, for ...
arXiv:2110.08423v1
fatcat:hgibexbgwzh2zczenriu3aunve
An asymptotically superlinearly convergent semismooth Newton augmented Lagrangian method for Linear Programming
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Powerful interior-point methods (IPM) based commercial solvers, such as Gurobi and Mosek, have been hugely successful in solving large-scale linear programming (LP) problems. ...
The high efficiency of these solvers depends critically on the sparsity of the problem data and advanced matrix factorization techniques. ...
One can observe that for the LP problem (46), our solver Snipal is much more efficient than the barrier method in Gurobi, and the former can be up to 117 times faster for the largest problem. ...
arXiv:1903.09546v2
fatcat:k7bmxhmtkvdzhjrlabokaew3um
Ecole: A Library for Learning Inside MILP Solvers
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Documentation and code can be found at https://www.ecole.ai. ...
It exposes sequential decision making that must be performed in the process of solving as Markov decision processes. ...
Acknowledgments This work was supported by the Canada Excellence Research Chair (CERC) in "Data Science for Real-Time Decision Making", Mila -Quebec Artificial Intelligence Institute, and IVADO -Institut ...
arXiv:2104.02828v1
fatcat:fwjl57xa4rd43aqudqkmp7tq7e
Generalized Benders Decomposition with Continual Learning for Hybrid Model Predictive Control in Dynamic Environment
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2023 pre-print arXiv:2310.03344v1 fatcat:gryonlwmwjhmdbvgxvrwnjktkm
After a short cold-start phase, the accumulated cuts provide warm-starts for the new problem instances to increase the solving speed. ...
Despite the randomly changing environment that the control is unprepared for, the solving speed maintains. ...
Acknowledgements The author would like to thank Zehui Lu, Shaoshuai Mou, and Yan Gu for their helpful discussions and suggestions. ...
arXiv:2310.03344v2
fatcat:otlpvzhumbee5mdu6scswckzye
Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
2015
INFORMS journal on computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This provides original insight into IPS that allows for the identification of weaknesses and potential alternative choices that would extend the efficiency of the method to a wider set of problems. ...
The problem of finding a strict improvement in the objective function is proved to be equivalent to two smaller problems respectively focusing on compatible and incompatible variables. ...
IPS outperformed direct solution with the primal simplex on several classes of problems including set partitioning, set covering, and warehouse location problems. ...
doi:10.1287/ijoc.2015.0656
fatcat:kmh4hu6tzbad5khipdql7u4tda
« Previous
Showing results 1 — 15 out of 160 results