:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Zhang, Bo
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2312.15384
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A strongly polynomial-time algorithm for the general linear programming problem
by: Awoniyi, Samuel
Published: (2025)

Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
by: Hoen, Alexander, et al.
Published: (2024)

On the feasibility of generalized inverse linear programs
by: Buchheim, Christoph, et al.
Published: (2025)

On the facet pivot simplex method for linear programming II: a linear iteration bound
by: Yang, Yaguang
Published: (2022)

A parallel branch-and-bound-and-prune algorithm for irregular strip packing with discrete rotations
by: Lastra-Díaz, Juan J., et al.
Published: (2025)

Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
by: Awoniyi, Samuel
Published: (2023)

A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
by: Awoniyi, Samuel
Published: (2023)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
by: Fouilhoux, Pierre, et al.
Published: (2024)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
by: Wang, Yan-Ru, et al.
Published: (2025)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

Model-free stochastic linear quadratic control for discrete-time systems with multiplicative and additive noises via semidefinite programming
by: Guo, Jing, et al.
Published: (2025)

Approximation algorithms for integer programming with resource augmentation
by: Brinkop, Hauke, et al.
Published: (2025)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

Parabolic optimal control problems with combinatorial switching constraints -- Part II: Outer approximation algorithm
by: Buchheim, Christoph, et al.
Published: (2022)

Model-free stochastic linear quadratic design by semidefinite programming
by: Guo, Jing, et al.
Published: (2024)

Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces
by: Kamoutsi, Angeliki, et al.
Published: (2024)

Real-rooted integer polynomial enumeration algorithms and interlacing polynomials via linear programming
by: Greaves, Gary R. W., et al.
Published: (2025)

Proximity-based approximation algorithms for integer bilevel programs
by: Sankaranarayanan, Sriram, et al.
Published: (2024)

Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
by: Derval, Guillaume, et al.
Published: (2024)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
by: Zhou, Junpeng, et al.
Published: (2023)

Convex semi-infinite programming algorithms with inexact separation oracles
by: Oustry, Antoine, et al.
Published: (2023)

Mixed-integer linear programming approaches for tree partitioning of power networks
by: Lan, Leon, et al.
Published: (2021)

On the optimal objective value of random linear programs
by: Bakhshi, Marzieh, et al.
Published: (2024)

Exact MAP inference in general higher-order graphical models using linear programming
by: Bechar, Ikhlef
Published: (2017)

A preconditioner for solving linear programming problems with dense columns
by: Villalba, Catalina J., et al.
Published: (2024)

Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
by: Chhatoi, Saroj Prasad, et al.
Published: (2025)

Performance bound analysis of linear consensus algorithm on strongly connected graphs using effective resistance and reversiblization
by: Yonaiyama, Takumi, et al.
Published: (2025)

Condensed-space methods for nonlinear programming on GPUs
by: Pacaud, François, et al.
Published: (2024)

A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021)

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
by: Lee, Ye Seol, et al.
Published: (2024)

Solving QUBOs with a quantum-amenable branch and bound method
by: Häner, Thomas, et al.
Published: (2024)

Obtaining properly Pareto optimal solutions of multiobjective optimization problems via the branch and bound method
by: Wu, Weitian, et al.
Published: (2024)

Integer Carathéodory results with bounded multiplicity
by: Kuhlmann, Stefan
Published: (2023)

Exploiting the polyhedral geometry of stochastic linear bilevel programming
by: Muñoz, Gonzalo, et al.
Published: (2022)

A vector linear programming approach for certain global optimization problems
by: Ciripoi, Daniel, et al.
Published: (2017)

Efficient modeling of chemotherapy regimens using mixed-integer linear programming
by: Billionnet, Alain
Published: (2026)

Solving a linear program via a single unconstrained minimization
by: Otemissov, Adilet, et al.
Published: (2025)

Sensitivity analysis of multiobjective linear programming from a geometric perspective
by: Kaci, Mustapha
Published: (2024)

An efficient mixed-integer linear programming formulation for solving influence diagrams
by: Terho, Topias, et al.
Published: (2026)

Branch-and-bound algorithm for efficient reliability analysis of general coherent systems
by: Byun, Ji-Eun, et al.
Published: (2024)