Copertina

Production optimization by agents of differing work rates

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Higgins, Peter M.
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Combinatorics Optimization and Control 90C27
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The rainbow covering number of clean tangled clutters
di: Abdi, Ahmad, et al.
Pubblicazione: (2025)

Generalizations of Total Dual Integrality
di: Guenin, Bertrand, et al.
Pubblicazione: (2025)

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

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
di: Kim, Junyoung, et al.
Pubblicazione: (2024)

Steiner Cut Dominants
di: Conforti, Michele, et al.
Pubblicazione: (2022)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
di: Murota, Kazuo, et al.
Pubblicazione: (2025)

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

Integral bases, perfect matchings, and the Petersen graph
di: Abdi, Ahmad, et al.
Pubblicazione: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

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

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

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
di: Clow, Alexander, et al.
Pubblicazione: (2025)

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

On the Dual of the Solvency Cone
di: Löhne, Andreas, et al.
Pubblicazione: (2014)

Minimizing the determinant of the graph Laplacian
di: Albin, Nathan, et al.
Pubblicazione: (2024)

Dantzig-Wolfe and Arc-Flow Reformulations: A Systematic Comparison
di: Yamin, Daniel, et al.
Pubblicazione: (2026)

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

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

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
di: Gaar, Elisabeth
Pubblicazione: (2020)

Biobjective optimization with M-convex functions
di: Fukuda, Ellen H., et al.
Pubblicazione: (2025)

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

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

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

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

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

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

Solving the Market Split Problem with Lattice Enumeration
di: Wassermann, Alfred
Pubblicazione: (2025)

A simple iterative algorithm for maxcut
di: Shao, Sihong, et al.
Pubblicazione: (2018)

Continuous iterative algorithms for anti-Cheeger cut
di: Shao, Sihong, et al.
Pubblicazione: (2021)

Branch-Price-and-Cut Accelerated with a Pricing for Integrality Heuristic for the Electrical Vehicle Routing Problem with Time Windows and Charging Time Slots
di: Eveborn, Lukas, et al.
Pubblicazione: (2026)

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

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
di: Polak, Sven
Pubblicazione: (2026)

Faster Parametric Submodular Function Minimization by Exploiting Duality
di: Gupta, Swati, et al.
Pubblicazione: (2026)

Strong SDP based bounds on the cutwidth of a graph
di: Gaar, Elisabeth, et al.
Pubblicazione: (2023)

A solution procedure for minimizing total completion time in a parallel-batching environment
di: Alfieri, Arianna, et al.
Pubblicazione: (2020)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
di: Gaar, Elisabeth, et al.
Pubblicazione: (2024)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
di: Druetto, Alessandro, et al.
Pubblicazione: (2024)

Box Allocation Optimization in Meal Kit Delivery
di: Nguyen, Thi Minh Thu, et al.
Pubblicazione: (2025)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
di: Brandt, Tabea, et al.
Pubblicazione: (2023)