:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Brandt, Tabea, Büsing, Christina, Engelhardt, Felix
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C27, 90C10, 90C90, 90B50
Online Access:	https://arxiv.org/abs/2401.00221
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Capacity Expansion Modelling for Renewable Energy Systems
by: Kebrich, Sebastian, et al.
Published: (2025)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

Edge expansion of a graph: SDP-based computational strategies
by: Gupte, Akshay, et al.
Published: (2024)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

On generalized KKT points for the Motzkin-Straus program
by: Beretta, G., et al.
Published: (2023)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
by: Xu, Mingming, et al.
Published: (2026)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
by: Jung, Woosuk L., et al.
Published: (2023)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

Metaheuristic algorithms for the induced P-median problem with upgrades
by: Salazar, Sergio, et al.
Published: (2026)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)

Deriving Priorities From Inconsistent PCM using the Network Algorithms
by: Anholcer, Marcin, et al.
Published: (2015)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
by: Shao, Sihong, et al.
Published: (2025)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Data-Driven Hull-Fouling Cleaning Schedule Optimization to Reduce Carbon Footprint of Vessels
by: Ward, Samuel, et al.
Published: (2026)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

Solving the Market Split Problem with Lattice Enumeration
by: Wassermann, Alfred
Published: (2025)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
by: Bui, Quang Minh, et al.
Published: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

Is Noisy Data a Blessing in Disguise? A Distributionally Robust Optimization Perspective
by: Hsieh, Chung-Han, et al.
Published: (2025)

Multi-objective stochastic linear programming with recourse and flexible decision making
by: Hamel, Andreas H., et al.
Published: (2024)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
by: Sinjorgo, Lennart, et al.
Published: (2025)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
by: Gomez, Andres, et al.
Published: (2024)

Practical Experience with Stable Set and Coloring Relaxations
by: Pucher, Dunja, et al.
Published: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
by: Salloum, Hadi, et al.
Published: (2025)

Fixed Topology Minimum-Length Trees with Neighborhoods
by: Blanco, Víctor, et al.
Published: (2024)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
by: Peiris, Vinesha, et al.
Published: (2026)

MOCVXPY: a CVXPY extension for multiobjective optimization
by: Salomon, Ludovic, et al.
Published: (2025)

A Decision-Making Method in Polyhedral Convex Set Optimization
by: Löhne, Andreas
Published: (2024)

Beyond Suspension: A Two-phase Methodology for Concluding Sports Leagues
by: Hassanzadeh, Ali, et al.
Published: (2024)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)