Copertina

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Borges, Jennifer C., Florentino, Helenice de O., Rangel, Socorro
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 90C90, 90C11, 90C29, 90C59
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

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

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2024)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

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

A solution method for arbitrary polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

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

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

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

Applying a Random-Key Optimizer on Mixed Integer Programs
di: Chaves, Antonio A., et al.
Pubblicazione: (2026)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
di: Liuzzi, Giampaolo, et al.
Pubblicazione: (2025)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
di: Xiaoyu, Luo, et al.
Pubblicazione: (2024)

Perpertual Coupled Simulated Annealing for Continuous Optimization
di: Gonçalves-e-Silva, Kayo, et al.
Pubblicazione: (2018)

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

CHAP: A Hybrid GPU-CPU Heuristic for MIP
di: Tjusila, Gennesaret Kharistio, et al.
Pubblicazione: (2026)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
di: Loris, Ignace, et al.
Pubblicazione: (2023)

Existence of solutions for polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
di: Badenbroek, Riley, et al.
Pubblicazione: (2024)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
di: Zeng, Renying
Pubblicazione: (2024)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
di: Guigues, Vincent, et al.
Pubblicazione: (2017)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
di: Tran, Trang H., et al.
Pubblicazione: (2026)

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

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
di: Bencheikh, Ali, et al.
Pubblicazione: (2024)

Warm-starting outer approximation for parametrized convex MINLP
di: Tamm, Erik, et al.
Pubblicazione: (2025)

Damage Location in Mechanical Structures by Multi-Objective Pattern Search
di: Günther, Christian, et al.
Pubblicazione: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Generalized Reduced Jacobian Method
di: Maghri, M. El, et al.
Pubblicazione: (2025)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
di: Lapucci, Matteo, et al.
Pubblicazione: (2023)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
di: Rahimi, Morteza, et al.
Pubblicazione: (2025)

Linear programming for finite-horizon vector-valued Markov decision processes
di: Mifrani, Anas, et al.
Pubblicazione: (2025)

Projected Gradient Methods with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2026)

An ODE approach to multiple choice polynomial programming
di: Shao, Sihong, et al.
Pubblicazione: (2022)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
di: Lin, Guangxuan, et al.
Pubblicazione: (2025)

Memetic Differential Evolution Methods for Semi-Supervised Clustering
di: Mansueto, Pierluigi, et al.
Pubblicazione: (2024)

An extension of an RLT-based solver to MINLP polynomial problems
di: González-Díaz, Julio, et al.
Pubblicazione: (2024)