Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms

Expert Systems with Applications

2023 | journal-article

A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup

Mathematics

2023 | journal-article

An Exact Optimization Approach for Personnel Scheduling Problems in the Call Center Industry

2023 | book-chapter

Arc flow formulations based on dynamic programming: Theoretical foundations and applications

European Journal of Operational Research

2022 | journal-article

An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows

International Transactions in Operational Research

2022 | journal-article

Column Generation Based Approaches for Combined Routing and Scheduling

Electronic Notes in Discrete Mathematics

2018 | journal-article

Column generation based primal heuristics for routing and loading problems

Electronic Notes in Discrete Mathematics

2018 | journal-article

Job shop schedules analysis in the context of industry 4.0

2017 International Conference on Engineering, Technology and Innovation: Engineering, Technology and Innovation Management Beyond 2020: New Challenges, New Approaches, ICE/ITMC 2017 - Proceedings

2018 | conference-paper

Models and advanced optimization algorithms for the integrated management of logistics operations

Springer Proceedings in Mathematics and Statistics

2018 | conference-paper

Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls

International Transactions in Operational Research

2018 | journal-article

Exact solution of the multi-trip inventory routing problem using a pseudo-polynomial model

ICORES 2017 - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems

2017 | conference-paper

Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints

European Journal of Operational Research

2017 | journal-article

Variable neighborhood search algorithms for pickup and delivery problems with loading constraints

Electronic Notes in Discrete Mathematics

2017 | journal-article

Variable neighborhood search for integrated planning and scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2017 | book

Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

2016 | book

A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2016 | book

An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling

Computers and Operations Research

2016 | journal-article

Combined cutting stock and scheduling: A matheuristic approach

International Journal of Innovative Computing and Applications

2016 | journal-article

Exact solution of combined cutting stock and scheduling problems

Lecture Notes in Economics and Mathematical Systems

2016 | book

Heuristic methods for the leather nesting problem in the automotive industry

International Journal of Business Excellence

2016 | journal-article

Integer programming based approaches for multi-trip location routing

Lecture Notes in Economics and Mathematical Systems

2016 | book

Constructing general dual-feasible functions

Operations Research Letters

2015 | journal-article

A model-based heuristic for the combined cutting stock and scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2015 | book

An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls

FME Transactions

2015 | journal-article

Exploring a column generation approach for a routing problem with sequential packing constraints

Operations Research and Big Data: IO2015-XVII Congress of Portuguese Association of Operational Research (APDIO)

2015 | book

Fast heuristics for integrated planning and scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2015 | book

GPU-based computing for nesting problems: The importance of sequences in static selection approaches

Operations Research and Big Data: IO2015-XVII Congress of Portuguese Association of Operational Research (APDIO)

2015 | book

Skewed general variable neighborhood search for the location routing scheduling problem

Computers and Operations Research

2015 | journal-article

Solving the Multiscenario Max-Min Knapsack Problem Exactly with Column Generation and Branch-and-Bound

Mathematical Problems in Engineering

2015 | journal-article

Variable neighborhood search for the elementary shortest path problem with loading constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2015 | book

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem

European Journal of Operational Research

2014 | journal-article

On the Properties of General Dual-Feasible Functions

Computational Science and Its Applications - Iccsa 2014, Pt Ii

2014 | book-chapter

On the properties of general dual-feasible functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2014 | book

A hybrid heuristic for the multiple choice multidimensional knapsack problem

Engineering Optimization

2013 | journal-article

Variable neighborhood search for the location routing problem with multiple routes

Proceedings of 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013

2013 | conference-paper

Variable neighborhood search for the location routing problem with multiple routes

Proceedings of 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013

2013 | conference-paper

Web system for supporting project management

Intelligent Systems, Control and Automation: Science and Engineering

2013 | book

A column generation approach for the bi-objective max-min knapsack problem

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

2012 | conference-paper

A column generation approach for the bi-objective max-min knapsack problem

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

2012 | conference-paper

A variable neighborhood search algorithm for the leather nesting problem

Mathematical Problems in Engineering

2012 | journal-article

An exact algorithm for bilevel 0-1 knapsack problems

Mathematical Problems in Engineering

2012 | journal-article

Computing valid inequalities for general integer programs using an extension of maximal dual feasible functions to negative arguments

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

2012 | conference-paper

Computing valid inequalities for general integer programs using an extension of maximal dual feasible functions to negative arguments

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

2012 | conference-paper

Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

2012 | conference-paper

Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

2012 | conference-paper

New constructive algorithms for leather nesting in the automotive industry

Computers & Operations Research

2012 | journal-article

On the extremality of maximal dual feasible functions

Operations Research Letters

2012 | journal-article

Worst-case analysis of maximal dual feasible functions

Optimization Letters

2012 | journal-article

Efficient lower bounding procedures with application in the allocation of virtual machines to data centers

WSEAS Transactions on Information Science and Applications

2011 | journal-article

Efficient lower bounding procedures with application in the allocation of virtual machines to data centers

WSEAS Transactions on Information Science and Applications

2011 | journal-article

General properties of staircase and convex dual feasible functions

WSEAS Transactions on Information Science and Applications

2011 | journal-article

General properties of staircase and convex dual feasible functions

WSEAS Transactions on Information Science and Applications

2011 | journal-article

New stabilization procedures for the cutting stock problem

INFORMS Journal on Computing

2011 | journal-article

New stabilization procedures for the cutting stock problem

INFORMS Journal on Computing

2011 | journal-article

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model

European Journal of Operational Research

2011 | journal-article

A survey of dual-feasible and superadditive functions

Annals of Operations Research

2010 | journal-article

Arc-flow model for the two-dimensional guillotine cutting stock problem

Computers & Operations Research

2010 | journal-article

Exploring new constructive algorithms for the leather nesting problem in the automotive industry

IFAC Proceedings Volumes (IFAC-PapersOnline)

2010 | conference-paper

Theoretical investigations on maximal dual feasible functions

Operations Research Letters

2010 | journal-article

New lower bounds based on column generation and constraint programming for the pattern minimization problem

Computers and Operations Research

2009 | journal-article

A branch-and-price-and-cut algorithm for the pattern minimization problem

RAIRO - Operations Research

2008 | journal-article

A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

Computers and Operations Research

2008 | journal-article

Gomory Cuts from a Position-Indexed Formulation of 1D Stock Cutting

Intelligent Decision Support

2008 | other

New integer programming formulations and an exact algorithm for the ordered cutting stock problem

Journal of the Operational Research Society

2008 | journal-article

Accelerating column generation for variable sized bin-packing problems

European Journal of Operational Research

2007 | journal-article