José M. Valério de Carvalho
Orcid: 0000-0002-5566-845XAffiliations:
- University of Minho, Portugal
According to our database1,
José M. Valério de Carvalho
authored at least 51 papers
between 1999 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2023
Eur. J. Oper. Res., June, 2023
2022
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups.
Optim. Lett., 2022
An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows.
Int. Trans. Oper. Res., 2022
Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res., 2022
2020
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls.
Int. Trans. Oper. Res., 2020
2019
A strong integer linear optimization model to the compartmentalized knapsack problem.
Int. Trans. Oper. Res., 2019
2018
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems.
Eur. J. Oper. Res., 2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
2017
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints.
Electron. Notes Discret. Math., 2017
2016
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling.
Comput. Oper. Res., 2016
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints.
Proceedings of the Computational Logistics - 7th International Conference, 2016
2015
Skewed general variable neighborhood search for the location routing scheduling problem.
Comput. Oper. Res., 2015
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015
Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015
2014
J. Oper. Res. Soc., 2014
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res., 2014
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014
A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014
2012
Comput. Oper. Res., 2012
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
Proceedings of the ICORES 2012, 2012
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.
Proceedings of the ICORES 2012, 2012
A Column Generation Approach for the Bi-objective Max-min Knapsack Problem.
Proceedings of the ICORES 2012, 2012
2011
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines.
Int. J. Manuf. Technol. Manag., 2011
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res., 2011
Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems.
Asia Pac. J. Oper. Res., 2011
2010
Oper. Res. Lett., 2010
Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem.
Optim. Methods Softw., 2010
An integer programming model for two- and three-stage two-dimensional cutting stock problems.
Eur. J. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
Comput. Oper. Res., 2010
2009
New lower bounds based on column generation and constraint programming for the pattern minimization problem.
Comput. Oper. Res., 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
RAIRO Oper. Res., 2008
New integer programming formulations and an exact algorithm for the ordered cutting stock problem.
J. Oper. Res. Soc., 2008
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem.
Comput. Oper. Res., 2008
2007
An extended model and a column generation algorithm for the planar multicommodity flow problem.
Networks, 2007
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times.
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
2006
2005
2002
A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems.
Comput. Optim. Appl., 2002
1999
Ann. Oper. Res., 1999