Cover Image

Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goldberg, Noam, Poss, Michael, Marmor, Yariv
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics 90C27 F.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
by: Goldberg, Noam, et al.
Published: (2026)

Robust Permutation Flowshops Under Budgeted Uncertainty
by: Goldberg, Noam, et al.
Published: (2026)

Graph burning: an overview of mathematical programs
by: Cajica-Maceda, Lourdes Beatriz, et al.
Published: (2025)

Extending the definition of set tolerances
by: Jäger, Gerold, et al.
Published: (2024)

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

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

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
by: Pozo, Miguel A., et al.
Published: (2022)

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

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

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
by: Masing, Berenike, et al.
Published: (2024)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

Scarf's Algorithm on Arborescence Hypergraphs
by: Chandrasekaran, Karthekeyan, et al.
Published: (2024)

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

Heuristic algorithms for the stochastic critical node detection problem
by: Bayarsaikhan, Tuguldur, et al.
Published: (2025)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

SAT-Based Search for Minwise Independent Families
by: Iurlano, Enrico, et al.
Published: (2024)

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

On the redundancy of transitivity constraints in the clique partitioning problem
by: Sukegawa, Noriyoshi
Published: (2026)

Moment generating functions in combinatorial optimization: Bipartite matching
by: Wästlund, Johan
Published: (2026)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Relaxation strength for multilinear optimization: McCormick strikes back
by: Schutte, Emily, et al.
Published: (2023)

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

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)

Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
by: Simmons, Miles, et al.
Published: (2025)

Shared Processor Scheduling of Multiprocessor Jobs
by: Dereniowski, Dariusz, et al.
Published: (2018)

Totally equimodular matrices: decomposition and triangulation
by: Chervet, Patrick, et al.
Published: (2025)

Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)

Further results on the lower bound on reduced Zagreb index of trees
by: Bašić, Milan, et al.
Published: (2026)

On the Importance of Studying the Membership Problem for Pedigree Polytopes
by: Arthanari, Tiru
Published: (2025)

Fairness in the k-Server Problem
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
by: Klein, Kim-Manuel, et al.
Published: (2024)

Loop unrolling of UCA models: distance labeling
by: Soulignac, Francisco J, et al.
Published: (2022)

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection
by: Coppé, Vianney, et al.
Published: (2022)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

Closeness and Decision Making
by: Dangalchev, Chavdar
Published: (2026)

A Menger-type theorem for two induced paths
by: Albrechtsen, Sandra, et al.
Published: (2023)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)