Copertina

Service Deployment in the On-Demand Economy: Employees, Contractors, or Both?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lu, Lijian, Weng, Xin, Xiao, Li
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90B22
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Empirical Evaluation of Policy-Based Reinforcement Learning for Dynamic Service Control in an M/M/1 Queue
di: Walton, Joseph, et al.
Pubblicazione: (2026)

Learning Dominant States in Elementary Resource Constrained Shortest Path Problems
di: Basso, Saverio, et al.
Pubblicazione: (2026)

Copositive Matrices with Ordered Off-Diagonal Entries
di: Blekherman, Grigoriy, et al.
Pubblicazione: (2026)

Multi-Action Restless Bandits with Weakly Coupled Constraints: Simultaneous Learning and Control
di: Fu, Jing, et al.
Pubblicazione: (2024)

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints
di: Chubanov, Sergei
Pubblicazione: (2025)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
di: Huang, Queenie Yingkun, et al.
Pubblicazione: (2024)

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control
di: Blanco, Víctor, et al.
Pubblicazione: (2026)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
di: de Klerk, Etienne, et al.
Pubblicazione: (2024)

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

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
di: Laurent, Monique, et al.
Pubblicazione: (2024)

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

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
di: Halaseh, Sami, et al.
Pubblicazione: (2026)

A more efficient reformulation of complex SDP as real SDP
di: Wang, Jie
Pubblicazione: (2023)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
di: Sim, Chee-Khian
Pubblicazione: (2022)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
di: Dolgopolik, M. V.
Pubblicazione: (2021)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
di: Liu, Yanqing, et al.
Pubblicazione: (2026)

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
di: Hansen, Siv Marie Cartland, et al.
Pubblicazione: (2026)

Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
di: Schlosser, Corbinian, et al.
Pubblicazione: (2020)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
di: Cifuentes, Diego, et al.
Pubblicazione: (2026)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
di: de Roux, Daniel, et al.
Pubblicazione: (2025)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
di: Li, Huimin, et al.
Pubblicazione: (2025)

Determining inscribability of polytopes via rank minimization based on slack matrices
di: Chen, Yiwen, et al.
Pubblicazione: (2025)

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)

Connections between Bressan's Mixing Conjecture, the Branched Optimal Transport and Combinatorial Optimization
di: Zhou, Bohan
Pubblicazione: (2024)

Cuts and semidefinite liftings for the complex cut polytope
di: Sinjorgo, Lennart, et al.
Pubblicazione: (2024)

On the complexity of a maintenance problem for hierarchical systems
di: Schulz, Andreas S., et al.
Pubblicazione: (2023)

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

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
di: Yang, Chengmiao, et al.
Pubblicazione: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
di: Guo, Feng, et al.
Pubblicazione: (2024)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
di: Bomze, Immanuel, et al.
Pubblicazione: (2024)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
di: Slot, Lucas, et al.
Pubblicazione: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
di: Marumo, Hiroki, et al.
Pubblicazione: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

A squared smoothing Newton method for semidefinite programming
di: Liang, Ling, et al.
Pubblicazione: (2023)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
di: Tang, Tianyun, et al.
Pubblicazione: (2026)

On the convexity for the range set of two quadratic functions
di: Nguyen, Huu-Quang, et al.
Pubblicazione: (2025)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
di: Fujii, Koichi, et al.
Pubblicazione: (2023)